Ioannis Mourtos

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 27

Top Topics

Scheduling Jobs

Weighted Tardiness

Stable Marriage

Top Venues

Discret. Optim.

Oper. Res. Lett.

Int. J. Prod. Res.

Discret. Appl. Math.

Publications

Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois
Weighted tardiness minimisation for unrelated machines with sequence-dependent and resource-constrained setups. Int. J. Prod. Res. 62 (1-2) (2024)
Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris
On Pareto optimal balanced exchanges. Discret. Optim. 52 (2024)
Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois
Scheduling unrelated machines with job splitting, setup resources and sequence dependency. Int. J. Prod. Res. 61 (16) (2023)
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
On cut polytopes and graph minors. Discret. Optim. 50 (2023)
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
Generalised 2-circulant inequalities for the max-cut problem. Oper. Res. Lett. 50 (2) (2022)
Eleni Zampou, Ioannis Mourtos, Katerina Pramatari, Stefan Seidel
A Design Theory for Energy and Carbon Management Systems in the Supply Chain. J. Assoc. Inf. Syst. 23 (1) (2022)
Petros Xepapadeas, Ioannis Mourtos
Refugee allocation mechanisms: theory and applications for the European Union. Oper. Res. 22 (4) (2022)
Ioannis Avgerinos, Ioannis Mourtos, Georgios Zois
Multi-type facility location in printing and parcel delivery services. Ann. Oper. Res. 309 (1) (2022)
Ioannis Mourtos, Michalis Samaris
Stable allocations and partially ordered sets. Discret. Optim. 46 (2022)
Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois
Scheduling Jobs on Unrelated Machines with Job Splitting and Setup Resource Constraints for Weaving in Textile Manufacturing. APMS (1) (2021)
Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris
Pareto optimal exchange with indifferent endowments. CoRR (2021)
Yuri Faenza, Ioannis Mourtos, Michalis Samaris, Jay Sethuraman
(Un)stable matchings with blocking costs. Oper. Res. Lett. 49 (5) (2021)
Ioannis Avgerinos, Ioannis Mourtos, Georgios Zois
Logic-Based Benders Decomposition for an Inter-modal Transportation Problem. CPAIOR (2021)
Pavlos Eirinakis, Kostas Kalaboukas, Stavros Lounis, Ioannis Mourtos, Joze M. Rozanec, Nenad Stojanovic, Georgios Zois
Enhancing Cognition for Digital Twins. ICE/ITMC (2020)
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
The diameter of the stable marriage polytope: Bounding from below. Discret. Math. 343 (5) (2020)
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
On matroid parity and matching polytopes. Discret. Appl. Math. 284 (2020)
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
The stable b-matching polytope revisited. Discret. Appl. Math. 250 (2018)
Dimitris Magos, Ioannis Mourtos
Submodularity and its application to some global constraints. Ann. Math. Artif. Intell. 79 (4) (2017)
Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
Fast separation for the three-index assignment problem. Math. Program. Comput. 9 (1) (2017)
Pavlos Eirinakis, Jorge Buenabad-Chávez, Rosanna Fornasiero, Haluk Gokmen, Julien-Etienne Mascolo, Ioannis Mourtos, Sven Spieckermann, Vasilis Tountopoulos, Frank Werner, Robert Woitsch
A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration. PRO-VE (2017)
Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Ioannis Mourtos, Maria J. Serna
The social cost of congestion games by imposing variable delays. ICT Express 3 (4) (2017)
Stathis Plitsos, Panagiotis P. Repoussis, Ioannis Mourtos, Christos D. Tarantilis
Energy-aware decision support for production scheduling. Decis. Support Syst. 93 (2017)
Stathis Plitsos, Dimitrios Magos, Ioannis Mourtos
An Integrated Solver for Multi-index Assignment. ISAIM (2016)
Ioannis Mourtos
Cardinality constraints and systems of restricted representatives. J. Comb. Optim. 31 (3) (2016)
Georgios Zois, Antonios Michaloliakos, Konstantinos Psounis, Vasilis Vassalos, Ioannis Mourtos
Non-asymptotic performance bounds for downlink MU-MIMO scheduling. WONS (2016)
Gautam Appa, Reinhardt Euler, Anastasia Kouvela, Dimitris Magos, Ioannis Mourtos
On the completability of incomplete orthogonal Latin rectangles. Discret. Math. 339 (6) (2016)
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
Pareto Optimal Matchings in Many-to-Many Markets with Ties. Theory Comput. Syst. 59 (4) (2016)
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
Pareto Optimal Matchings in Many-to-Many Markets with Ties. SAGT (2015)
Eleni Zampou, Katerina Pramatari, Ioannis Mourtos
Design of Environmental Performance Monitoring Systems in the Supply Chain: The Role of Interoperability. ECIS (2015)
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
Pareto Optimal Matchings in Many-to-Many Markets with Ties. CoRR (2015)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Blockers and antiblockers of stable matchings. Theor. Comput. Sci. 524 (2014)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
Polyhedral Aspects of Stable Marriage. Math. Oper. Res. 39 (3) (2014)
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Potpinková
Pareto optimality in many-to-many matching problems. Discret. Optim. 14 (2014)
Eleni Zampou, Stathis Plitsos, Angeliki Karagiannaki, Ioannis Mourtos
Towards a framework for energy-aware information systems in manufacturing. Comput. Ind. 65 (3) (2014)
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
From One Stable Marriage to the Next: How Long Is the Way? SIAM J. Discret. Math. 28 (4) (2014)
Ioannis Mourtos
Tight LP-Relaxations of Overlapping Global Cardinality Constraints. CPAIOR (2013)
Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
Fast Separation Algorithms for Three-Index Assignment Problems. ISCO (2012)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem. INFORMS J. Comput. 24 (2) (2012)
Dimitris Magos, Ioannis Mourtos, Gautam Appa
A polyhedral approach to the alldifferent system. Math. Program. 132 (1-2) (2012)
Dimitris Magos, Ioannis Mourtos
On the Facial Structure of the Alldifferent System. SIAM J. Discret. Math. 25 (1) (2011)
Dimitris Magos, Ioannis Mourtos
Clique facets of the axial and planar assignment polytopes. Discret. Optim. 6 (4) (2009)
Konstantinos Kounetas, Ioannis Mourtos, Konstantinos Tsekouras
Efficiency decompositions for heterogeneous technologies. Eur. J. Oper. Res. 199 (1) (2009)
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis
Persistency and matroid intersection. Comput. Manag. Sci. 6 (4) (2009)
Dimitris Magos, Ioannis Mourtos
The wheels of the OLS polytope: Facets and separation. Discret. Math. 308 (16) (2008)
Athanasios P. Kalogeras, Konstantinos J. Charatsis, Ioannis Mourtos, Fotios Liotopoulos, George Asimakopoulos, Panagiotis Konstantinopoulos
Integrated real-time system for perishable freight transport management. ETFA (2008)
Angeliki Karagiannaki, Ioannis Mourtos, Katerina Pramatari
Simulating and evaluating the impact of RFID on warehousing operations: a case study. SCSC (2007)
George Asimakopoulos, Ioannis Mourtos, Vassilis Triantafillou
A real time RFID enhanced haulage monitoring system. MobiMedia (2007)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
Hyperarc Consistency for the Stable Admissions Problem. ICTAI (1) (2007)
Gautam Appa, Dimitris Magos, Ioannis Mourtos
A new class of facets for the Latin square polytope. Discret. Appl. Math. 154 (6) (2006)
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis
The Matching Predicate and a Filtering Scheme Based on Matroids. J. Comput. 1 (6) (2006)
Gautam Appa, Dimitris Magos, Ioannis Mourtos
Searching for Mutually Orthogonal Latin Squares via integer and constraint programming. Eur. J. Oper. Res. 173 (2) (2006)
Gautam Appa, Dimitris Magos, Ioannis Mourtos, Jeannette C. M. Janssen
On the orthogonal Latin squares polytope. Discret. Math. 306 (2) (2006)
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis
Consistency of the Matching Predicate. SETN (2006)
Gautam Appa, Dimitris Magos, Ioannis Mourtos
predicates. Inf. Process. Lett. 94 (3) (2005)
Gautam Appa, Dimitris Magos, Ioannis Mourtos
The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities. J. Comb. Optim. 10 (4) (2005)
Gautam Appa, Dimitris Magos, Ioannis Mourtos
LP Relaxations of Multiple all_different Predicates. CPAIOR (2004)
Gautam Appa, Dimitrios Magos, Ioannis Mourtos
A Branch & Cut algorithm for a four-index assignment problem. J. Oper. Res. Soc. 55 (3) (2004)
Gautam Appa, Dimitris Magos, Ioannis Mourtos
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. Oper. Res. Lett. 32 (4) (2004)
Konstantinos Antonis, John D. Garofalakis, Ioannis Mourtos, Paul G. Spirakis
A hierarchical adaptive distributed algorithm for load balancing. J. Parallel Distributed Comput. 64 (1) (2004)
Gautam Appa, Ioannis Mourtos, Dimitris Magos
Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. CP (2002)