Ioannis Mourtos

Orcid: 0000-0002-9243-7327

According to our database1, Ioannis Mourtos authored at least 59 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weighted tardiness minimisation for unrelated machines with sequence-dependent and resource-constrained setups.
Int. J. Prod. Res., January, 2024

2023
On cut polytopes and graph minors.
Discret. Optim., November, 2023

Scheduling unrelated machines with job splitting, setup resources and sequence dependency.
Int. J. Prod. Res., August, 2023

2022
Generalised 2-circulant inequalities for the max-cut problem.
Oper. Res. Lett., 2022

Refugee allocation mechanisms: theory and applications for the European Union.
Oper. Res., 2022

A Design Theory for Energy and Carbon Management Systems in the Supply Chain.
J. Assoc. Inf. Syst., 2022

Stable allocations and partially ordered sets.
Discret. Optim., 2022

Multi-type facility location in printing and parcel delivery services.
Ann. Oper. Res., 2022

2021
(Un)stable matchings with blocking costs.
Oper. Res. Lett., 2021

Pareto optimal exchange with indifferent endowments.
CoRR, 2021

Scheduling Jobs on Unrelated Machines with Job Splitting and Setup Resource Constraints for Weaving in Textile Manufacturing.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

Logic-Based Benders Decomposition for an Inter-modal Transportation Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2020
The diameter of the stable marriage polytope: Bounding from below.
Discret. Math., 2020

On matroid parity and matching polytopes.
Discret. Appl. Math., 2020

Enhancing Cognition for Digital Twins.
Proceedings of the 2020 IEEE International Conference on Engineering, 2020

2018
The stable b-matching polytope revisited.
Discret. Appl. Math., 2018

2017
Fast separation for the three-index assignment problem.
Math. Program. Comput., 2017

The social cost of congestion games by imposing variable delays.
ICT Express, 2017

Energy-aware decision support for production scheduling.
Decis. Support Syst., 2017

Submodularity and its application to some global constraints.
Ann. Math. Artif. Intell., 2017

A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration.
Proceedings of the Collaboration in a Data-Rich World, 2017

2016
Pareto Optimal Matchings in Many-to-Many Markets with Ties.
Theory Comput. Syst., 2016

Cardinality constraints and systems of restricted representatives.
J. Comb. Optim., 2016

On the completability of incomplete orthogonal Latin rectangles.
Discret. Math., 2016

Non-asymptotic performance bounds for downlink MU-MIMO scheduling.
Proceedings of the 12th Annual Conference on Wireless On-demand Network Systems and Services, 2016

An Integrated Solver for Multi-index Assignment.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015
Design of Environmental Performance Monitoring Systems in the Supply Chain: The Role of Interoperability.
Proceedings of the 23rd European Conference on Information Systems, 2015

2014
Blockers and antiblockers of stable matchings.
Theor. Comput. Sci., 2014

From One Stable Marriage to the Next: How Long Is the Way?
SIAM J. Discret. Math., 2014

Polyhedral Aspects of Stable Marriage.
Math. Oper. Res., 2014

Pareto optimality in many-to-many matching problems.
Discret. Optim., 2014

Optimizing the Social Cost of Congestion Games by Imposing Variable Delays.
CoRR, 2014

Towards a framework for energy-aware information systems in manufacturing.
Comput. Ind., 2014

2013
Tight LP-Relaxations of Overlapping Global Cardinality Constraints.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
A polyhedral approach to the alldifferent system.
Math. Program., 2012

Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem.
INFORMS J. Comput., 2012

Fast Separation Algorithms for Three-Index Assignment Problems.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
On the Facial Structure of the Alldifferent System.
SIAM J. Discret. Math., 2011

2009
An Artificial Market for Emission Permits.
Proceedings of the Tools and Applications with Artificial Intelligence, 2009

Efficiency decompositions for heterogeneous technologies.
Eur. J. Oper. Res., 2009

Clique facets of the axial and planar assignment polytopes.
Discret. Optim., 2009

Persistency and matroid intersection.
Comput. Manag. Sci., 2009

2008
The wheels of the OLS polytope: Facets and separation.
Discret. Math., 2008

Integrated real-time system for perishable freight transport management.
Proceedings of 13th IEEE International Conference on Emerging Technologies and Factory Automation, 2008

2007
Simulating and evaluating the impact of RFID on warehousing operations: a case study.
Proceedings of the 2007 Summer Computer Simulation Conference, 2007

A real time RFID enhanced haulage monitoring system.
Proceedings of the 3rd International Conference on Mobile Multimedia Communications, 2007

Hyperarc Consistency for the Stable Admissions Problem.
Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2006
The Matching Predicate and a Filtering Scheme Based on Matroids.
J. Comput., 2006

Searching for Mutually Orthogonal Latin Squares via integer and constraint programming.
Eur. J. Oper. Res., 2006

On the orthogonal Latin squares polytope.
Discret. Math., 2006

A new class of facets for the Latin square polytope.
Discret. Appl. Math., 2006

Consistency of the Matching Predicate.
Proceedings of the Advances in Artificial Intelligence, 4th Helenic Conference on AI, 2006

2005
The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities.
J. Comb. Optim., 2005

On the system of two <i>all_different</i> predicates.
Inf. Process. Lett., 2005

2004
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.
Oper. Res. Lett., 2004

A hierarchical adaptive distributed algorithm for load balancing.
J. Parallel Distributed Comput., 2004

A Branch & Cut algorithm for a four-index assignment problem.
J. Oper. Res. Soc., 2004

LP Relaxations of Multiple all_different Predicates.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2002
Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2002


  Loading...