Ioannis Mourtos

70 papers A 1B 4C 3Misc 1Journal 47Unranked 13
YearRankTypeTitle / Venue / Authors
2025 J jnl
A unified solution framework for flexible job shop scheduling problems with multiple resource constraints.
Eur. J. Oper. Res.
Gregory A. Kasapidis, Dimitris C. Paraskevopoulos, Ioannis Mourtos, Panagiotis P. Repoussis
2025 — conf
An Integrated Optimisation Method for Aluminium Hot Rolling.
CPAIOR (1)
Ioannis Avgerinos, Apostolos Besis, Ioannis Mourtos, Athanasios Psarros, Stavros Vatikiotis, Georgios Zois
2025 J jnl
One Benders cut to rule all schedules in the neighbourhood.
Eur. J. Oper. Res.
Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois
2025 — conf
Optimising a Manufacturing-as-a-Service Platform Through Mathematical Modeling.
APMS (6)
Angelos Ioannis Lagos, Ioannis Avgerinos, Georgios Zois, Ioannis Mourtos, Patricia Casla
2025 J jnl
Pickup & Delivery with Time Windows and Transfers: combining decomposition with metaheuristics.
CoRR
Ioannis Avgerinos, Ioannis Mourtos, Nikolaos Tsompanidis, Georgios Zois
2025 J jnl
Social classroom seating assignment problems.
Networks
Alessandro Hill, David Hom, Steffen Peuker, Ioannis Mourtos
2024 — conf
Developing a Circular and Resilient Information System: A Design Science Approach.
APMS (1)
Timoleon Farmakis, Anastasios Koukopoulos, Georgios Zois, Ioannis Mourtos, Stavros Lounis, Kostas Kalaboukas
2024 — conf
Innovations in Manufacturing Business Models Enabled by Digital and AI-driven Transformation: A Conceptual Framework.
ICE/ITMC
Timoleon Farmakis, Stavros Lounis, Ioanna Sofia Georgoutsou, Anastasios Koukopoulos, Ioannis Mourtos
2024 — conf
Makespan Minimisation in Hybrid Flexible Flowshops with Buffers and Machine-Dependent Transportation Times.
APMS (6)
Stavros Vatikiotis, Ilias Mpourdakos, Dimitrios Papathanasiou, Ioannis Mourtos
2024 J jnl
On Pareto optimal balanced exchanges.
Discret. Optim.
Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris
2024 J jnl
Weighted tardiness minimisation for unrelated machines with sequence-dependent and resource-constrained setups.
Int. J. Prod. Res.
Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois
2023 J jnl
On cut polytopes and graph minors.
Discret. Optim.
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
2023 J jnl
Scheduling unrelated machines with job splitting, setup resources and sequence dependency.
Int. J. Prod. Res.
Ioannis Avgerinos, Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois
2022 J jnl
A Design Theory for Energy and Carbon Management Systems in the Supply Chain.
J. Assoc. Inf. Syst.
Eleni Zampou, Ioannis Mourtos, Katerina Pramatari, Stefan Seidel
2022 J jnl
Generalised 2-circulant inequalities for the max-cut problem.
Oper. Res. Lett.
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
2022 J jnl
Multi-type facility location in printing and parcel delivery services.
Ann. Oper. Res.
Ioannis Avgerinos, Ioannis Mourtos, Georgios Zois
2022 J jnl
Refugee allocation mechanisms: theory and applications for the European Union.
Oper. Res.
Petros Xepapadeas, Ioannis Mourtos
2022 J jnl
Stable allocations and partially ordered sets.
Discret. Optim.
Ioannis Mourtos, Michalis Samaris
2021 J jnl
(Un)stable matchings with blocking costs.
Oper. Res. Lett.
Yuri Faenza, Ioannis Mourtos, Michalis Samaris, Jay Sethuraman
2021 B conf
Logic-Based Benders Decomposition for an Inter-modal Transportation Problem.
CPAIOR
Ioannis Avgerinos, Ioannis Mourtos, Georgios Zois
2021 J jnl
Pareto optimal exchange with indifferent endowments.
CoRR
Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris
2021 — conf
Scheduling Jobs on Unrelated Machines with Job Splitting and Setup Resource Constraints for Weaving in Textile Manufacturing.
APMS (1)
Ioannis Mourtos, Stavros Vatikiotis, Georgios Zois
2020 — conf
Enhancing Cognition for Digital Twins.
ICE/ITMC
Pavlos Eirinakis, Kostas Kalaboukas, Stavros Lounis, Ioannis Mourtos, Joze M. Rozanec, Nenad Stojanovic, Georgios Zois
2020 J jnl
On matroid parity and matching polytopes.
Discret. Appl. Math.
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
2020 J jnl
The diameter of the stable marriage polytope: Bounding from below.
Discret. Math.
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
2018 J jnl
The stable b-matching polytope revisited.
Discret. Appl. Math.
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
2017 C conf
A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration.
PRO-VE
Pavlos Eirinakis, Jorge Buenabad-Chávez, Rosanna Fornasiero, Haluk Gokmen, Julien-Etienne Mascolo, Ioannis Mourtos, Sven Spieckermann, Vasilis Tountopoulos, Frank Werner, Robert Woitsch
2017 J jnl
Energy-aware decision support for production scheduling.
Decis. Support Syst.
Stathis Plitsos, Panagiotis P. Repoussis, Ioannis Mourtos, Christos D. Tarantilis
2017 J jnl
Fast separation for the three-index assignment problem.
Math. Program. Comput.
Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
2017 J jnl
Submodularity and its application to some global constraints.
Ann. Math. Artif. Intell.
Dimitris Magos, Ioannis Mourtos
2017 J jnl
The social cost of congestion games by imposing variable delays.
ICT Express
Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Ioannis Mourtos, Maria J. Serna
2016 Misc conf
An Integrated Solver for Multi-index Assignment.
ISAIM
Stathis Plitsos, Dimitrios Magos, Ioannis Mourtos
2016 J jnl
Cardinality constraints and systems of restricted representatives.
J. Comb. Optim.
Ioannis Mourtos
2016 — conf
Non-asymptotic performance bounds for downlink MU-MIMO scheduling.
WONS
Georgios Zois, Antonios Michaloliakos, Konstantinos Psounis, Vasilis Vassalos, Ioannis Mourtos
2016 J jnl
On the completability of incomplete orthogonal Latin rectangles.
Discret. Math.
Gautam Appa, Reinhardt Euler, Anastasia Kouvela, Dimitris Magos, Ioannis Mourtos
2016 J jnl
Pareto Optimal Matchings in Many-to-Many Markets with Ties.
Theory Comput. Syst.
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
2015 — conf
Design of Environmental Performance Monitoring Systems in the Supply Chain: The Role of Interoperability.
ECIS
Eleni Zampou, Katerina Pramatari, Ioannis Mourtos
2015 B conf
Pareto Optimal Matchings in Many-to-Many Markets with Ties.
SAGT
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
2015 J jnl
Pareto Optimal Matchings in Many-to-Many Markets with Ties.
CoRR
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari
2014 J jnl
Blockers and antiblockers of stable matchings.
Theor. Comput. Sci.
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
2014 J jnl
From One Stable Marriage to the Next: How Long Is the Way?
SIAM J. Discret. Math.
Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
2014 J jnl
Pareto optimality in many-to-many matching problems.
Discret. Optim.
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Potpinková
2014 J jnl
Polyhedral Aspects of Stable Marriage.
Math. Oper. Res.
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
2014 J jnl
Towards a framework for energy-aware information systems in manufacturing.
Comput. Ind.
Eleni Zampou, Stathis Plitsos, Angeliki Karagiannaki, Ioannis Mourtos
2013 B conf
Tight LP-Relaxations of Overlapping Global Cardinality Constraints.
CPAIOR
Ioannis Mourtos
2012 J jnl
A polyhedral approach to the alldifferent system.
Math. Program.
Dimitris Magos, Ioannis Mourtos, Gautam Appa
2012 C conf
Fast Separation Algorithms for Three-Index Assignment Problems.
ISCO
Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
2012 J jnl
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem.
INFORMS J. Comput.
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
2011 J jnl
On the Facial Structure of the Alldifferent System.
SIAM J. Discret. Math.
Dimitris Magos, Ioannis Mourtos
2009 — ch.
An Artificial Market for Emission Permits.
Tools and Applications with Artificial Intelligence
Ioannis Mourtos, Spyros Xanthopoulos
2009 J jnl
Clique facets of the axial and planar assignment polytopes.
Discret. Optim.
Dimitris Magos, Ioannis Mourtos
2009 J jnl
Efficiency decompositions for heterogeneous technologies.
Eur. J. Oper. Res.
Konstantinos Kounetas, Ioannis Mourtos, Konstantinos Tsekouras
2009 J jnl
Persistency and matroid intersection.
Comput. Manag. Sci.
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis
2008 C conf
Integrated real-time system for perishable freight transport management.
ETFA
Athanasios P. Kalogeras, Konstantinos J. Charatsis, Ioannis Mourtos, Fotios Liotopoulos, George Asimakopoulos, Panagiotis Konstantinopoulos
2008 J jnl
The wheels of the OLS polytope: Facets and separation.
Discret. Math.
Dimitris Magos, Ioannis Mourtos
2007 — conf
A real time RFID enhanced haulage monitoring system.
MobiMedia
George Asimakopoulos, Ioannis Mourtos, Vassilis Triantafillou
2007 — conf
Hyperarc Consistency for the Stable Admissions Problem.
ICTAI (1)
Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis
2007 — conf
Simulating and evaluating the impact of RFID on warehousing operations: a case study.
SCSC
Angeliki Karagiannaki, Ioannis Mourtos, Katerina Pramatari
2006 J jnl
A new class of facets for the Latin square polytope.
Discret. Appl. Math.
Gautam Appa, Dimitris Magos, Ioannis Mourtos
2006 — conf
Consistency of the Matching Predicate.
SETN
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis
2006 J jnl
On the orthogonal Latin squares polytope.
Discret. Math.
Gautam Appa, Dimitris Magos, Ioannis Mourtos, Jeannette C. M. Janssen
2006 J jnl
Searching for Mutually Orthogonal Latin Squares via integer and constraint programming.
Eur. J. Oper. Res.
Gautam Appa, Dimitris Magos, Ioannis Mourtos
2006 J jnl
The Matching Predicate and a Filtering Scheme Based on Matroids.
J. Comput.
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitsoulis
2005 J jnl
On the system of two
Inf. Process. Lett.
Gautam Appa, Dimitris Magos, Ioannis Mourtos
2005 J jnl
The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities.
J. Comb. Optim.
Gautam Appa, Dimitris Magos, Ioannis Mourtos
2004 J jnl
A Branch & Cut algorithm for a four-index assignment problem.
J. Oper. Res. Soc.
Gautam Appa, Dimitrios Magos, Ioannis Mourtos
2004 J jnl
A hierarchical adaptive distributed algorithm for load balancing.
J. Parallel Distributed Comput.
Konstantinos Antonis, John D. Garofalakis, Ioannis Mourtos, Paul G. Spirakis
2004 J jnl
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.
Oper. Res. Lett.
Gautam Appa, Dimitris Magos, Ioannis Mourtos
2004 B conf
LP Relaxations of Multiple all_different Predicates.
CPAIOR
Gautam Appa, Dimitris Magos, Ioannis Mourtos
2002 A conf
Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem.
CP
Gautam Appa, Ioannis Mourtos, Dimitris Magos