Ioannis Mourtos

发表

The Matching Predicate and a Filtering Scheme Based on Matroids

Leonidas S. Pitsoulis, Dimitris Magos, Ioannis Mourtos, 2006, J. Comput..

Tight LP-Relaxations of Overlapping Global Cardinality Constraints

Ioannis Mourtos, 2013, CPAIOR.

Pareto Optimal Matchings in Many-to-Many Markets with Ties

David Manlove, Katarína Cechlárová, Tamás Fleiner, 2015, Theory of Computing Systems.

Non-asymptotic performance bounds for downlink MU-MIMO scheduling

Antonios Michaloliakos, Konstantinos Psounis, Vasilis Vassalos, 2016, 2016 12th Annual Conference on Wireless On-demand Network Systems and Services (WONS).

Hyperarc Consistency for the Stable Admissions Problem

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2007, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007).

Blockers and antiblockers of stable matchings

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2014, Theor. Comput. Sci..

A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration

Sven Spieckermann, Robert Woitsch, Rosanna Fornasiero, 2017, PRO-VE.

A polyhedral approach to the alldifferent system

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2012, Math. Program..

Cardinality constraints and systems of restricted representatives

Ioannis Mourtos, 2016, J. Comb. Optim..

Simulating and evaluating the impact of RFID on warehousing operations: a case study

Katerina Pramatari, Ioannis Mourtos, Angeliki Karagiannaki, 2007, SCSC.

Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2002, CP.

A new class of facets for the Latin square polytope

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2006, Discret. Appl. Math..

A real time RFID enhanced haulage monitoring system

Ioannis Mourtos, George Asimakopoulos, Vassilis Triantafillou, 2007, MobiMedia '07.

Searching for Mutually Orthogonal Latin Squares via integer and constraint programming

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2006, Eur. J. Oper. Res..

Submodularity and its application to some global constraints

Dimitris Magos, Ioannis Mourtos, 2016, Annals of Mathematics and Artificial Intelligence.

LP Relaxations of Multiple all_different Predicates

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2004, CPAIOR.

Hyperarc Consistency for the Stable Admissions Problem

Ioannis Mourtos, Pavlos Eirinakis, D. Magos, 2007 .

Design of Environmental Performance Monitoring Systems in the Supply Chain: The Role of Interoperability

Katerina Pramatari, Ioannis Mourtos, Eleni Zampou, 2015, ECIS.

The stable b-matching polytope revisited

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2018, Discret. Appl. Math..

EFFECT OF LONGITUDINAL BULKHEADS ON DAMAGE STABILITY OF MODEL RO/RO FERRIES

Carl T.F. Ross, Ioannis Mourtos, George Papanikolaou, 2003 .

The diameter of the stable marriage polytope: Bounding from below

Ioannis Mourtos, Pavlos Eirinakis, Dimitrios Magos, 2020, Discret. Math..

Pareto optimality in many-to-many matching problems

Katarína Cechlárová, Tamás Fleiner, Dimitris Magos, 2014, Discret. Optim..

Efficiency decompositions for heterogeneous technologies

Konstantinos Kounetas, Ioannis Mourtos, Konstantinos Tsekouras, 2009, Eur. J. Oper. Res..

Towards a framework for energy-aware information systems in manufacturing

Ioannis Mourtos, Angeliki Karagiannaki, Eleni Zampou, 2014, Comput. Ind..

On the completability of incomplete orthogonal Latin rectangles

Reinhardt Euler, Dimitris Magos, Ioannis Mourtos, 2016, Discret. Math..

Enhancing Cognition for Digital Twins

Ioannis Mourtos, Pavlos Eirinakis, Nenad Stojanovic, 2020, 2020 IEEE International Conference on Engineering, Technology and Innovation (ICE/ITMC).

On the system of two all_different predicates

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2005, Inf. Process. Lett..

On the orthogonal Latin squares polytope

Dimitris Magos, Ioannis Mourtos, Jeannette C. M. Janssen, 2006, Discret. Math..

An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2004, Oper. Res. Lett..

An Artificial Market for Emission Permits

Ioannis Mourtos, Spyros Xanthopoulos, 2009, Tools and Applications with Artificial Intelligence.

Pareto Optimal Matchings in Many-to-Many Markets with Ties

David Manlove, Katarína Cechlárová, Tamás Fleiner, 2015, SAGT.

On matroid parity and matching polytopes

Adam N. Letchford, Ioannis Mourtos, Konstantinos Kaparis, 2020, Discret. Appl. Math..

Clique facets of the axial and planar assignment polytopes

Dimitris Magos, Ioannis Mourtos, D. Magos, 2009, Discret. Optim..

The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2005, J. Comb. Optim..

Energy-aware decision support for production scheduling

Christos D. Tarantilis, Ioannis Mourtos, Panagiotis P. Repoussis, 2017, Decis. Support Syst..

A hierarchical adaptive distributed algorithm for load balancing

Paul G. Spirakis, John D. Garofalakis, Ioannis Mourtos, 2004, J. Parallel Distributed Comput..

On the Facial Structure of the Alldifferent System

Dimitris Magos, Ioannis Mourtos, 2011, SIAM J. Discret. Math..

Polyhedral Aspects of Stable Marriage

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2014, Math. Oper. Res..

Fast Separation Algorithms for Three-Index Assignment Problems

Frits C. R. Spieksma, Trivikram Dokka, Ioannis Mourtos, 2012, ISCO.

Fast separation algorithms for multidimensional assignment problems

Frits C. R. Spieksma, Trivikram Dokka, Ioannis Mourtos, 2011 .

Consistency of the Matching Predicate

Leonidas S. Pitsoulis, Dimitris Magos, Ioannis Mourtos, 2006, SETN.

From One Stable Marriage to the Next: How Long Is the Way?

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2014, SIAM J. Discret. Math..

An Integrated Solver for Multi-index Assignment

Dimitris Magos, Ioannis Mourtos, Stathis Plitsos, 2016, ISAIM.

Persistency and matroid intersection

Leonidas S. Pitsoulis, Dimitris Magos, Ioannis Mourtos, 2009, Comput. Manag. Sci..

Polyhedral results for assignment problems

Ioannis Mourtos, Gautam Appa, D. Magos, 2002 .

Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2012, INFORMS J. Comput..

Fast separation for the three-index assignment problem

Frits C. R. Spieksma, Trivikram Dokka, Ioannis Mourtos, 2016, Mathematical Programming Computation.

A Branch & Cut algorithm for a four-index assignment problem

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2004, J. Oper. Res. Soc..

A Design Theory for Energy and Carbon Management Systems in the Supply Chain

Katerina Pramatari, Stefan Seidel, Ioannis Mourtos, 2022, J. Assoc. Inf. Syst..

Scheduling Jobs on Unrelated Machines with Job Splitting and Setup Resource Constraints for Weaving in Textile Manufacturing

Ioannis Mourtos, Georgios Zois, Stavros Vatikiotis, 2021, APMS.

Situation-aware manufacturing systems for capturing and handling disruptions

Ioannis Mourtos, Panagiotis P. Repoussis, Pavlos Eirinakis, 2021 .

Multi-type facility location in printing and parcel delivery services

Ioannis Mourtos, Georgios Zois, Ioannis Avgerinos, 2022, Ann. Oper. Res..

Pareto optimal exchange with indifferent endowments pdf

Ioannis Mourtos, Pavlos Eirinakis, Michalis Samaris, 2021, ArXiv.

(Un)stable matchings with blocking costs

Ioannis Mourtos, Yuri Faenza, Jay Sethuraman, 2021, Oper. Res. Lett..

Logic-Based Benders Decomposition for an Inter-modal Transportation Problem

Ioannis Mourtos, Georgios Zois, Ioannis Avgerinos, 2021, CPAIOR.

Clique Facets of the Orthogonal Latin Squares Polytope É

Jeannette Janssen, Ioannis Mourtos, Gautam Appa, 2001 .

Is energy intensity important for the productivity growth of EET adopters

Konstantinos Kounetas, Ioannis Mourtos, Konstantinos Tsekouras, 2012 .

Finding a minimum-regret many-to-many Stable Matching

Ioannis Mourtos, Pavlos Eirinakis, Dimitrios Magos, 2013 .