Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. - Gautam Appa; Ioannis Mourtos; Dimitris Magos (CP, 2002)

LP Relaxations of Multiple all_different Predicates. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (CPAIOR, 2004)

A Branch & Cut algorithm for a four-index assignment problem. - Gautam Appa; Dimitrios Magos; Ioannis Mourtos (J. Oper. Res. Soc., 2004)

A hierarchical adaptive distributed algorithm for load balancing. - Konstantinos Antonis; John D. Garofalakis; Ioannis Mourtos; Paul G. Spirakis (J. Parallel Distributed Comput., 2004)

An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (Oper. Res. Lett., 2004)

On the system of two all_different predicates. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (Inf. Process. Lett., 2005)

The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (J. Comb. Optim., 2005)

Consistency of the Matching Predicate. - Dimitris Magos; Ioannis Mourtos; Leonidas S. Pitsoulis (SETN, 2006)

A new class of facets for the Latin square polytope. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (Discret. Appl. Math., 2006)

On the orthogonal Latin squares polytope. - Gautam Appa; Dimitris Magos; Ioannis Mourtos; Jeannette C. M. Janssen (Discret. Math., 2006)

Searching for Mutually Orthogonal Latin Squares via integer and constraint programming. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (Eur. J. Oper. Res., 2006)

The Matching Predicate and a Filtering Scheme Based on Matroids. - Dimitris Magos; Ioannis Mourtos; Leonidas S. Pitsoulis (J. Comput., 2006)

Hyperarc Consistency for the Stable Admissions Problem. - Pavlos Eirinakis; Dimitris Magos; Ioannis Mourtos; Panayiotis Miliotis (ICTAI (1), 2007)

A real time RFID enhanced haulage monitoring system. - George Asimakopoulos; Ioannis Mourtos; Vassilis Triantafillou (MobiMedia, 2007)

Simulating and evaluating the impact of RFID on warehousing operations: a case study. - Angeliki Karagiannaki; Ioannis Mourtos; Katerina Pramatari (SCSC, 2007)

Integrated real-time system for perishable freight transport management. - Athanasios P. Kalogeras; Konstantinos J. Charatsis; Ioannis Mourtos; Fotios Liotopoulos; George Asimakopoulos; Panagiotis Konstantinopoulos (ETFA, 2008)

The wheels of the OLS polytope: Facets and separation. - Dimitris Magos; Ioannis Mourtos (Discret. Math., 2008)

Persistency and matroid intersection. - Dimitris Magos; Ioannis Mourtos; Leonidas S. Pitsoulis (Comput. Manag. Sci., 2009)

Clique facets of the axial and planar assignment polytopes. - Dimitris Magos; Ioannis Mourtos (Discret. Optim., 2009)

Efficiency decompositions for heterogeneous technologies. - Konstantinos Kounetas; Ioannis Mourtos; Konstantinos Tsekouras (Eur. J. Oper. Res., 2009)

An Artificial Market for Emission Permits. - Ioannis Mourtos; Spyros Xanthopoulos (Tools and Applications with Artificial Intelligence, 2009)

On the Facial Structure of the Alldifferent System. - Dimitris Magos; Ioannis Mourtos (SIAM J. Discret. Math., 2011)

Fast Separation Algorithms for Three-Index Assignment Problems. - Trivikram Dokka; Ioannis Mourtos; Frits C. R. Spieksma (ISCO, 2012)

Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem. - Pavlos Eirinakis; Dimitris Magos; Ioannis Mourtos; Panayiotis Miliotis (INFORMS J. Comput., 2012)

A polyhedral approach to the alldifferent system. - Dimitris Magos; Ioannis Mourtos; Gautam Appa (Math. Program., 2012)

Tight LP-Relaxations of Overlapping Global Cardinality Constraints. - Ioannis Mourtos (CPAIOR, 2013)

Towards a framework for energy-aware information systems in manufacturing. - Eleni Zampou; Stathis Plitsos; Angeliki Karagiannaki; Ioannis Mourtos (Comput. Ind., 2014)

Optimizing the Social Cost of Congestion Games by Imposing Variable Delays. - Josep Díaz; Ioannis Giotis 001; Lefteris M. Kirousis; Yiannis Mourtos; Maria J. Serna (CoRR, 2014)

Pareto optimality in many-to-many matching problems. - Katarína Cechlárová; Pavlos Eirinakis; Tamás Fleiner; Dimitrios Magos; Ioannis Mourtos; Eva Potpinková (Discret. Optim., 2014)

Polyhedral Aspects of Stable Marriage. - Pavlos Eirinakis; Dimitris Magos; Ioannis Mourtos; Panayiotis Miliotis (Math. Oper. Res., 2014)

From One Stable Marriage to the Next: How Long Is the Way? - Pavlos Eirinakis; Dimitrios Magos; Ioannis Mourtos (SIAM J. Discret. Math., 2014)

Blockers and antiblockers of stable matchings. - Pavlos Eirinakis; Dimitris Magos; Ioannis Mourtos (Theor. Comput. Sci., 2014)

Design of Environmental Performance Monitoring Systems in the Supply Chain: The Role of Interoperability. - Eleni Zampou; Katerina Pramatari; Ioannis Mourtos (ECIS, 2015)

An Integrated Solver for Multi-index Assignment. - Stathis Plitsos; Dimitrios Magos; Ioannis Mourtos (ISAIM, 2016)

Non-asymptotic performance bounds for downlink MU-MIMO scheduling. - Georgios Zois; Antonios Michaloliakos; Konstantinos Psounis; Vasilis Vassalos; Ioannis Mourtos (WONS, 2016)

On the completability of incomplete orthogonal Latin rectangles. - Gautam Appa; Reinhardt Euler; Anastasia Kouvela; Dimitris Magos; Ioannis Mourtos (Discret. Math., 2016)

Cardinality constraints and systems of restricted representatives. - Ioannis Mourtos (J. Comb. Optim., 2016)

Pareto Optimal Matchings in Many-to-Many Markets with Ties. - Katarína Cechlárová; Pavlos Eirinakis; Tamás Fleiner; Dimitrios Magos; David F. Manlove; Ioannis Mourtos; Eva Oceláková; Baharak Rastegari (Theory Comput. Syst., 2016)

A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration. - Pavlos Eirinakis; Jorge Buenabad-Chávez; Rosanna Fornasiero; Haluk Gokmen; Julien-Etienne Mascolo; Ioannis Mourtos; Sven Spieckermann; Vasilis Tountopoulos; Frank Werner 003; Robert Woitsch (PRO-VE, 2017)

Submodularity and its application to some global constraints. - Dimitris Magos; Ioannis Mourtos (Ann. Math. Artif. Intell., 2017)

Energy-aware decision support for production scheduling. - Stathis Plitsos; Panagiotis P. Repoussis; Ioannis Mourtos; Christos D. Tarantilis (Decis. Support Syst., 2017)

The social cost of congestion games by imposing variable delays. - Josep Díaz; Ioannis Giotis 001; Lefteris M. Kirousis; Ioannis Mourtos; Maria J. Serna (ICT Express, 2017)

Fast separation for the three-index assignment problem. - Trivikram Dokka; Ioannis Mourtos; Frits C. R. Spieksma (Math. Program. Comput., 2017)

The stable b-matching polytope revisited. - Pavlos Eirinakis; Dimitrios Magos; Ioannis Mourtos (Discret. Appl. Math., 2018)

Enhancing Cognition for Digital Twins. - Pavlos Eirinakis; Kostas Kalaboukas; Stavros Lounis; Ioannis Mourtos; Joze M. Rozanec; Nenad Stojanovic; Georgios Zois (ICE/ITMC, 2020)

On matroid parity and matching polytopes. - Konstantinos Kaparis; Adam N. Letchford; Ioannis Mourtos (Discret. Appl. Math., 2020)

The diameter of the stable marriage polytope: Bounding from below. - Pavlos Eirinakis; Dimitrios Magos; Ioannis Mourtos (Discret. Math., 2020)

Logic-Based Benders Decomposition for an Inter-modal Transportation Problem. - Ioannis Avgerinos; Ioannis Mourtos; Georgios Zois (CPAIOR, 2021)

Scheduling Jobs on Unrelated Machines with Job Splitting and Setup Resource Constraints for Weaving in Textile Manufacturing. - Ioannis Mourtos; Stavros Vatikiotis; Georgios Zois (APMS (1), 2021)

Pareto optimal exchange with indifferent endowments. - Pavlos Eirinakis; Ioannis Mourtos; Michalis Samaris (CoRR, 2021)

(Un)stable matchings with blocking costs. - Yuri Faenza; Ioannis Mourtos; Michalis Samaris; Jay Sethuraman (Oper. Res. Lett., 2021)

Multi-type facility location in printing and parcel delivery services. - Ioannis Avgerinos; Ioannis Mourtos; Georgios Zois (Ann. Oper. Res., 2022)

Stable allocations and partially ordered sets. - Ioannis Mourtos; Michalis Samaris (Discret. Optim., 2022)

A Design Theory for Energy and Carbon Management Systems in the Supply Chain. - Eleni Zampou; Ioannis Mourtos; Katerina Pramatari; Stefan Seidel 001 (J. Assoc. Inf. Syst., 2022)

Refugee allocation mechanisms: theory and applications for the European Union. - Petros Xepapadeas; Ioannis Mourtos (Oper. Res., 2022)

Generalised 2-circulant inequalities for the max-cut problem. - Konstantinos Kaparis; Adam N. Letchford; Ioannis Mourtos (Oper. Res. Lett., 2022)

Scheduling unrelated machines with job splitting, setup resources and sequence dependency. - Ioannis Avgerinos; Ioannis Mourtos; Stavros Vatikiotis; Georgios Zois (Int. J. Prod. Res., 2023)

On cut polytopes and graph minors. - Konstantinos Kaparis; Adam N. Letchford; Ioannis Mourtos (Discret. Optim., 2023)

Innovations in Manufacturing Business Models Enabled by Digital and AI-driven Transformation: A Conceptual Framework. - Timoleon Farmakis; Stavros Lounis; Ioanna Sofia Georgoutsou; Anastasios Koukopoulos; Ioannis Mourtos (ICE/ITMC, 2024)

Developing a Circular and Resilient Information System: A Design Science Approach. - Timoleon Farmakis; Anastasios Koukopoulos; Georgios Zois; Ioannis Mourtos; Stavros Lounis; Kostas Kalaboukas (APMS (1), 2024)

Makespan Minimisation in Hybrid Flexible Flowshops with Buffers and Machine-Dependent Transportation Times. - Stavros Vatikiotis; Ilias Mpourdakos; Dimitrios Papathanasiou; Ioannis Mourtos (APMS (6), 2024)

On Pareto optimal balanced exchanges. - Pavlos Eirinakis; Ioannis Mourtos; Michalis Samaris (Discret. Optim., 2024)

Weighted tardiness minimisation for unrelated machines with sequence-dependent and resource-constrained setups. - Ioannis Avgerinos; Ioannis Mourtos; Stavros Vatikiotis; Georgios Zois (Int. J. Prod. Res., 2024)

An Integrated Optimisation Method for Aluminium Hot Rolling. - Ioannis Avgerinos; Apostolos Besis; Ioannis Mourtos; Athanasios Psarros; Stavros Vatikiotis; Georgios Zois (CPAIOR (1), 2025)

One Benders cut to rule all schedules in the neighbourhood. - Ioannis Avgerinos; Ioannis Mourtos; Stavros Vatikiotis; Georgios Zois (Eur. J. Oper. Res., 2025)

A unified solution framework for flexible job shop scheduling problems with multiple resource constraints. - Gregory A. Kasapidis; Dimitris C. Paraskevopoulos; Ioannis Mourtos; Panagiotis P. Repoussis (Eur. J. Oper. Res., 2025)

Social classroom seating assignment problems. - Alessandro Hill; David Hom; Steffen Peuker; Ioannis Mourtos (Networks, 2025)

Pickup & Delivery with Time Windows and Transfers: combining decomposition with metaheuristics. - Ioannis Avgerinos; Ioannis Mourtos; Nikolaos Tsompanidis; Georgios Zois (CoRR, 2025)