Δρ. Γιάννης Μούρτος

  • -
mourtos

Δρ. Γιάννης Μούρτος

Πληροφορίες

Ε-mail:

mourtos [at] aueb [dot] gr

Τηλέφωνο γραφείου:

+30 2108203802

Fax:

+30 2108203664

Διεύθυνση:

Πατησίων 95, 3ος όροφος, Αθήνα, Ελλάδα

Σύντομο Βιογραφικό Σημείωμα

Ο Γιάννης Μούρτος είναι Λέκτορας «Μαθηματικών της Επιχειρησιακής Έρευνας» στο Τμήμα Διοικητικής Επιστήμης και Τεχνολογίας του Οικονομικού Πανεπιστημίου Αθηνών. Σπούδασε Μηχανικός Η/Υ & Πληροφορικής στο Πανεπιστήμιο Πατρών και κατόπιν ολοκλήρωσε τις μεταπτυχιακές του σπουδές (ΜSc, PhD) στην Eπιχειρησιακή Έρευνα στο Πανεπιστήμιο του Λονδίνου (London School of Economics & Political Science). Έχει επίσης εργαστεί ως Λέκτορας στο Τμήμα Οικονομικών Επιστημών του Πανεπιστημίου Πατρών.

Ερευνητικά ενδιαφέροντα

Η ερευνητική του δραστηριότητα εντάσσεται κυρίως στις περιοχές της Συνδυαστικής Βελτιστοποίησης και του Ακέραιου Προγραμματισμού, ενώ παράλληλα εξετάζει το συνδυασμό αλγορίθμων Ακέραιου και Λογικού Προγραμματισμού. Έχει δημοσιεύσει σε περιοδικά Επιχειρησιακής Έρευνας και Επιστήμης των Υπολογιστών, όπως Mathematical Programming, Informs Journal on Computing, SIAM Journal on Discrete Mathematics, Operations Research Letters, European Journal of Operational Research and Discrete Mathematics, για αρκετά από τα οποία έχει επιτελέσει καθήκοντα κριτή. Επίσης, έχει συμμετάσχει σε Εθνικά και Ευρωπαϊκά ερευνητικά προγράμματα.

Πλήρες Βιογραφικό Σημείωμα

Download

Δημοσιεύσεις

1α. Δημοσιεύσεις σε περιοδικά (με Impact Factor)

[1] P. Eirinakis, D. Magos, I. Mourtos: Blockers and antiblockers of stable matchings, Theoretical Computer Science, in press (doi: 10.1016/j.tcs.2013.12.017)
[2] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis: Polyhedral aspects of stable marriage, Mathematics of Operations Research, in press (doi: 10.1287/moor.2013.0616)
[3] E. Zampou, S. Plitsos, A. Karagiannaki and I. Mourtos Towards a framework for energy-aware information systems in manufacturing, Computers in Industry, accepted.
[4] D. Magos, I. Mourtos (2013): A characterisation of odd-hole inequalities related to Latin squares, Optimization 62, 1169-1201.
[5] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis (2013): Finding a minimum regret stable b-matching, Optimization 62, 1007-1018
[6] D. Magos, I. Mourtos and G. Appa (2012): A polyhedral approach to the alldifferent system Mathematical Programming, 132, 209-260.
[7] Alexandra Kontolaimou, Konstantinos Kounetas, Ioannis Mourtos, Kostas Tsekouras (2012): Technology Gaps in European Banking: put the blame on inputs or outputs?, Economic Modelling 29, 1798-1808.
[8] K. Kounetas, I. Mourtos and K. Tsekouras (2012): Is energy intensity important for the productivity growth of EET adopters? Energy Economics 34, 930-941.
[9] P. Eirinakis, D. Magos, I. Mourtos, and P. Miliotis (2012): Finding all stable pairs and solutions to the (many-to-many) Stable Matching Problem. INFORMS Journal on Computing 24, 245-259.
[10] D. Magos, I. Mourtos (2011): On the facial structure of the AllDifferent system. SIAM Journal on Discrete Mathematics 25, 130-158.
[11] D. Magos and I. Mourtos (2009): Clique facets of the axial and planar assignment polytopes. Discrete Optimization 6, 394-413.
[12] K. Kounetas, I. Mourtos and K. Tsekouras (2009): Efficiency decompositions for heterogeneous technologies, European Journal of Operational Research 199, 209-218.
[13] Magos and I. Mourtos (2008): The wheels of the OLS polytope: Facets and separation, Discrete Mathematics 308, 3634-3651.
[14] G. Appa, D. Magos and I. Mourtos (2006): Searching for Mutually Orthogonal Latin Squares via Integer and Constraint Programming, European Journal of Operational Research 173, 519-530.
[15] G. Appa, D. Magos and I. Mourtos (2006): A new class of facets for the Latin square polytope, Discrete Applied Mathematics 154, 900-911.
[16] G. Appa, D. Magos and I. Mourtos (2006): On multi-index assignment polytopes. Linear Algebra and its Applications 416, 224–241.
[17] G. Appa, D. Magos, I. Mourtos and J.C.M. Janssen (2006): On the Orthogonal Latin Squares polytope, Discrete Mathematics 306, 171-187.
[18] G. Appa, D. Magos and I. Mourtos (2005): On the system of two all_different predicates, Information Processing Letters 94, 99-105.
[19] G. Appa, D. Magos and I. Mourtos (2005): Wheels of the OLS polytope, Journal of Combinatorial Optimization 10, 365-389.
[20] K. Antonis, J. Garofalakis, I. Mourtos and P. Spirakis (2004): A Hierarchical Adaptive Distributed Algorithm for Load Balancing. Journal of Parallel and Distributed Computing 64, 151-162.
[21] G. Appa, D. Magos and I. Mourtos (2004): A Branch & Cut algorithm for the planar four-index assignment problem, Journal of the Operational Research Society 55, 298-307.
[22] G. Appa, D. Magos and I. Mourtos (2004): An LP-based proof for the non-existence of a pair of Orthogonal Latin Squares of order 6, Operations Research Letters 32, 336-344.

1β. Άλλες δημοσιεύσεις σε περιοδικά

[23] D. Magos, I. Mourtos and L. Pitsoulis (2009): Persistency and matroid intersection, Computational Management Science 6, 435-445.
[24] D. Magos, I. Mourtos and L. Pitsoulis (2006): The Matching Predicate and a Filtering Scheme Based on Matroids, Journal of Computers, 1 (2006), 37-42 (invited).

2. Δημοσιεύσεις σε βιβλία/συλλογικούς τόμους

[25] G. Appa, D. Magos, I. Mourtos and L. Pitsoulis: Modelling for feasibility – the case of mutually orthogonal Latin squares problem. In G. Appa, L. Pitsoulis, H.P. Williams (eds): Handbook on modelling for discrete optimization, International Series in Operations Research and Management Science 88, Springer-Verlag (2006).
[26] Ι. Mourtos and S. Xanthopoulos: An Artificial Market for Emission Permits. In C. Koutsojannis, S. Sirmakessis (eds.) Tools and Applications with Artificial Intelligence, Studies in Computational Intelligence 166, 69-76, Springer-Verlag (2009).

3α. Δημοσιεύσεις σε πρακτικά συνεδρίων με κρίση στο πλήρες κείμενο και δημοσίευση σε συλλογικό τόμο

[27] I. Mourtos: Tight LP-relaxations of overlapping global cardinality constraints, in C.Gomes, M.Sellman (Eds.), CPAIOR 2013, Lecture Notes in Computer Science, Springer-Verlag, Berlin-Heidelberg (to appear).
[28] Τ. Dokka, Ι. Mourtos, F. Spieksma: Fast Separation Algorithms for Three-Index Assignment problems, in A.R. Mahjoub et al. (Eds.): ISCO 2012, Lecture Notes in Computer Science 7422, pp. 189–200, 2012, Springer-Verlag, Berlin-Heidelberg.
[29] A. Kalogeras, K. Charatsis, I. Mourtos, F. Liotopoulos, G. Asimakopoulos, P. Konstantinopoulos: Integrated Real-Time System for Perishable Freight Transport Management, Proceedings of the IEEE Emerging Technologies and Factory Automation, 2008 (ETFA 2008), 21-24.
[30] P. Eirinakis, D. Magos, I. Mourtos, Ioannis, P. Miliotis, Hyperarc Consistency for the Stable Admissions Problem, Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence, 2007 (ICTAI 2007) 1, 239-242.
[31] D. Magos, I. Mourtos and L. Pitsoulis: Consistency of the matching predicate. Lecture Notes in Artificial Intelligence 3955, 555–558, Springer-Verlag (2006).
[32] G. Appa, D. Magos and I. Mourtos: LP relaxations of multiple all_different predicates. In J.C. Regin, M. Rueher (eds.): Lecture Notes in Computer Science 3011, 364-369 Springer-Verlag (2004).
[33] G. Appa, I. Mourtos and D. Magos: Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. Lecture Notes in Computer Science 2470, 15-31 (2002).

3β. Παρουσιάσεις σε άλλα συνέδρια (με κρίση περίληψης, ενδεικτικά)

[1] I. Mourtos, The polytope of cardinality constraints, 25th European Conference on Operational Research” (EURO XXIV), Vilnius, July 11-14, 2012 (invited presentation).
[2] D. Magos, I. Mourtos, A Polyhedral Study of the Alldifferent System, 11th International Symposium on Artificial Intelligence and Mathematics” (ISAIM 2010), Fort Lauderdale, Florida, January 6-8, 2010 (invited presentation).
[3] D. Magos, I. Mourtos, T. Yunes, A Polyhedral Study of the Cumulative Constraint, 11th International Symposium on Artificial Intelligence and Mathematics” (ISAIM 2010), Fort Lauderdale, Florida, January 6-8, 2010 (invited presentation).
[4] D. Magos, I. Mourtos, Characterising odd-hole inequalities related to Latin squares, 24th European Conference on Operational Research” (EURO XXIV), Lisbon, July 11-14, 2010 (invited presentation).
[5] P. Eirinakis, D. Magos, I. Mourtos and P. Miliotis, Non-stable pairs in the Stable Marriage problem and multi-index configurations, 24th European Conference on Operational Research” (EURO XXIV), Lisbon, July 11-14, 2010 (invited presentation).
[6] G. Appa, A. Kouvela and D. Magos and I. Mourtos, 11 Methods for proving infeasibility of IP’s, 24th European Conference on Operational Research” (EURO XXIV), Lisbon, July 11-14, 2010 (invited presentation).
[7] A. Karagiannaki, I. Mourtos and K. Pramatari: Simulating and evaluating the impact of RFID on warehousing operations: a case study, Proceedings of SCSC’07, 34 (2007).
[8] D. Magos, I. Mourtos (2007): Branch and Cut for multi-index assignment problems, 22nd European Conference on Operational Research (EURO XXII), Prague, Czech Republic.
[9] D. Magos and I. Mourtos (2006): Valid inequalities and facets of the OLS polytope, 9th International Symposium in Mathematical Programming (ISMP 2006), Rio de Janeiro, Brazil.
[10] K. Kounetas, I. Mourtos and K. Tsekouras (2006): Alternative Decompositions of Efficiency for Firms Operating under Metatechnology Sets, UK Efficiency & Productivity Analysis Network Conference, Leicester, UK.
[11] C. Bardaki, A. Karagiannaki, K. C. Pramatari, and I. Mourtos (2006): Rfid technology: Simulating the impact on supply chain and demand in retail industry, 21st European Conference in Operational Research (EURO XXI), Reykjavik, Iceland.
[12] Mourtos I., Markellos R.N., Xanthopoulos S. (2005): Auction design for emission permits. 7th European Energy Conference, Norwegian School of Economics, Bergen, Norway.
[13] G. Appa, D. Magos and I. Mourtos (2004): Multidimensional assignment problems. 20th European Conference on Operational Research (EURO XX), Rhodes, Greece.
[14] G. Appa, D. Magos and I. Mourtos (2004): Polyhedral results for assignment problems, International Symposium on Combinatorial Optimization (CO2004), Lancaster, UK.
[15] G. Appa, D. Magos and I. Mourtos (2003): On the Integration of Integer and Constraint Programming, 8th International Symposium in Mathematical Programming (ISMP 2003), Copenhagen, Denmark.

4α. Ερευνητικά έργα ως Επιστημονικός Υπεύθυνος

1. ARTISAN-Energy-aware enterprise systems for low-carbon intelligent operations, FP7-ICT-2011-7, Collaborative project (Project number 287993), 2011-2014 (Επιστ. Υπεύθ. Ερευνητικής ομάδας ΟΠΑ)
2. From Graph Theory to Matroids: Algorithms and Applications, 2011-2015, Πρόγραμμα ‘Θαλής’ (Επιστ. Υπευθ. Ερευνητικής Ομάδας ΟΠΑ).
3. EERNV-Energy Efficiency of Road Networks and Vehicles: Measurement, Pricing, Regional and Environmental Effects, 2011-2015, Πρόγραμμα ‘Θαλής’ (Επιστ. Υπευθ. Ερευνητικής Ομάδας ΟΠΑ).
4. “Assignment Problems and all-different predicates”, Πρόγραμμα Ενίσχυσης Βασικής Έρευνας, Οικονομικό Πανεπιστήμιο Αθηνών, 2010-11.
5. “Multi-sided stable matchings: structure and algorithms”, Πρόγραμμα Ενίσχυσης Βασικής Έρευνας, Οικονομικό Πανεπιστήμιο Αθηνών, 2008-09.
6. ΣΕΛΙΔΑ-Σύστημα Διαχείρισης Έντυπου Υλικού με Χρήση Τεχνολογίας Ραδιοσυχνικής Αναγνώρισης, ΣΥΝΕΡΓΑΣΙΑ 2009, 2011-2014 (Επιστ. Υπεύθ. Ερευνητικής ομάδας ΟΠΑ).
7. Ανάπτυξη Μεθόδων Οργάνωσης, Διοίκησης και Λειτουργίας Κατανεμημένων Εικονικών Επιχειρήσεων Ανάπτυξης Συστημάτων Πληροφορικής (ΜΕΘΟΔΙΚΑ), Ε.Π. ΔΥΤΙΚΗΣ ΕΛΛΑΔΑΣ, ΜΕΤΡΟ 3.4, Πρόγραμμα «Κοινοπραξίες Έρευνας και Τεχνολογικής Ανάπτυξης σε τομείς Εθνικής Προτεραιότητας», 2005-08 (Επιστ. Υπεύθ. Ερευνητικής ομάδας Πανεπ. Πατρών).

4β. Ερευνητικά έργα ως συμμετέχοντας ερευνητής
(Ενδεικτικά)
1. “Reinforcing Investments in biogas technologies for small- scale RES applications in islands” (BIORES), Intelligent Energy Europe, European Union 6th Framework Program (2006-09, ερευνητής).
2. “Intelligent Integration of Supply Chain Processes and Consumer Services based on Unique Product Identification in a Networked Business Environment” (SMART), ICT for Networked Businesses, European Union 6th Framework Program (2007-09, ερευνητής).
3. Ολοκληρωμένο Σύστημα Πραγματικού Χρόνου για τη Διαχείριση Στόλου Φορτηγών Ψυγείων Διεθνών Μεταφορών Ευπαθών Τροφίμων (ΜΕΤΑΤΡΟ), Ε.Π. ΑΤΤΙΚΗΣ, ΜΕΤΡΟ 1.2, Πρόγραμμα «Κοινοπραξίες Έρευνας και Τεχνολογικής Ανάπτυξης σε τομείς Εθνικής Προτεραιότητας» (2005-08, ερευνητής).

5. Ετεροαναφορές (ενδεικτικά)
(Περιοδικά, Πρακτικά συνεδρίων και Reference Textbooks, Scopus, Web of Science, Google Scholar)
1. John N. Hooker, Hybrid Modeling in Hybrid Optimization, Springer Optimization and Its Applications, 2011, Volume 45, 11-62, DOI: 10.1007/978-1-4419-1644-0_2.
2. Hélcio Vieira Jr., Susan Sanchez, Karl Heinz Kienitz, Mischel Carmen Neyra Belderrain, Generating and improving orthogonal designs by using mixed integer programming, European Journal of Operational Research 215, 629–638 (2011)
3. A.P. Burgera, M.P. Kidd and J.H. van Vuurena, A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6, Discrete Mathematics 311 (13), pp. 1223-1228 (2011).
4. Viera Borbelová and Katarína Cechlárová, Rotations in the stable -matching problem Theoretical Computer Science 411, 1750-1762 (2010).
5. A. Kontolaimou, K. Tsekouras, Are cooperatives the weakest link in European banking? A non-parametric metafrontier approach, Journal of Banking & Finance 34, 1946-1957 (2010).
6. E.K. Burke, J. Mareček, A.J. Parkes and H. Rudová, A supernodal formulation of vertex colouring with applications in course timetabling, Annals of Operations Research 179, 105-130 (2010).
7. Euler R., On the completability of incomplete Latin squares, European Journal of Combinatorics 31, 535-552 (2010) (2 citations).
8. Kuroki Y, Matsui T, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, Discrete Applied Mathematics 157, 2124-2135 (2009).
9. N. Chen, N. Immorlica, A.R. Karlin, M.Mahdian and A. Rudra, Approximating Matches Made in Heaven, Lecture Notes in Computer Science 5555, 266-278 (2009).
10. Kaski P, Ostergard P, Classification of resolvable balanced incomplete block designs – the unitals on 28 points, Mathematica Slovaca 59, 121-136 (2009).
11. Bulutoglu DA, Margot F, Classification of orthogonal arrays by integer programming, Journal of Statistical Planning and Inference 138, 654-666 (2008) (2 citations).
12. Kutz M, Elbassioni K, Katriel I, Simultaneous matchings: Hardness and approximation, Journal of Computer and System Sciences 74, 884-897 (2008).
13. Hooker JN, Integrated Methods for Optimization, Springer-Verlag (2007) (3 citations).
14. Iqbal S, Carey GF, Performance analysis of dynamic load balancing algorithms with variable number of processors, Journal of Parallel and Distributed Computing 65, 934-948 (2005).

6. Έρευνα σε εξέλιξη

1. Cardinality system, JOCO (1st revision to be submitted until March)
2. Pareto-optimal, DISOPT (submitted)
3. Poset-polytope, DAM (submitted)
4. Stable b-matching polytope, MathProg (to be submitted until March)
5. Diameter, SIDMA (submitted)
6. 3AP, fast separation, DAM (to be submitted until March)
7. Circuits of OLS, EJCOMB (to be submitted until September)
8. Submodularity in CP, Constraints (to be submitted until September)
9. Hierarchical flowshop, Comp. and OR (to be submitted until March)
10. Kirchberger-based credit scoring, JORS (to be submitted until September)