default search action
Ioannis Mourtos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j42]Gregory A. Kasapidis
, Dimitris C. Paraskevopoulos
A unified solution framework for flexible job shop scheduling problems with multiple resource constraints. Eur. J. Oper. Res. 320(3): 479-495 (2025) - 2024
- [j41]Pavlos Eirinakis
On Pareto optimal balanced exchanges. Discret. Optim. 52: 100835 (2024) - [j40]Ioannis Avgerinos
Weighted tardiness minimisation for unrelated machines with sequence-dependent and resource-constrained setups. Int. J. Prod. Res. 62(1-2): 359-379 (2024) - [c19]Timoleon Farmakis, Anastasios Koukopoulos, Georgios Zois, Ioannis Mourtos, Stavros Lounis, Kostas Kalaboukas:
Developing a Circular and Resilient Information System: A Design Science Approach. APMS (1) 2024: 64-79 - [c18]Stavros Vatikiotis
Makespan Minimisation in Hybrid Flexible Flowshops with Buffers and Machine-Dependent Transportation Times. APMS (6) 2024: 258-273 - 2023
- [j39]Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
On cut polytopes and graph minors. Discret. Optim. 50: 100807 (2023) - [j38]Ioannis Avgerinos
Scheduling unrelated machines with job splitting, setup resources and sequence dependency. Int. J. Prod. Res. 61(16): 5502-5524 (2023) - 2022
- [j37]Ioannis Avgerinos
Multi-type facility location in printing and parcel delivery services. Ann. Oper. Res. 309(1): 365-393 (2022) - [j36]Ioannis Mourtos
Stable allocations and partially ordered sets. Discret. Optim. 46: 100731 (2022) - [j35]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): 2 (2022) - [j34]Petros Xepapadeas
Refugee allocation mechanisms: theory and applications for the European Union. Oper. Res. 22(4): 4557-4584 (2022) - [j33]Konstantinos Kaparis
Generalised 2-circulant inequalities for the max-cut problem. Oper. Res. Lett. 50(2): 122-128 (2022) - 2021
- [j32]Yuri Faenza, Ioannis Mourtos
(Un)stable matchings with blocking costs. Oper. Res. Lett. 49(5): 655-662 (2021) - [c17]Ioannis Avgerinos
Logic-Based Benders Decomposition for an Inter-modal Transportation Problem. CPAIOR 2021: 315-331 - [c16]Ioannis Mourtos
Scheduling Jobs on Unrelated Machines with Job Splitting and Setup Resource Constraints for Weaving in Textile Manufacturing. APMS (1) 2021: 424-434 - [i3]Pavlos Eirinakis, Ioannis Mourtos, Michalis Samaris:
Pareto optimal exchange with indifferent endowments. CoRR abs/2104.00465 (2021) - 2020
- [j31]Konstantinos Kaparis
On matroid parity and matching polytopes. Discret. Appl. Math. 284: 322-331 (2020) - [j30]Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
The diameter of the stable marriage polytope: Bounding from below. Discret. Math. 343(5): 111804 (2020) - [c15]Pavlos Eirinakis, Kostas Kalaboukas
Enhancing Cognition for Digital Twins. ICE/ITMC 2020: 1-7
2010 – 2019
- 2018
- [j29]Pavlos Eirinakis
The stable b-matching polytope revisited. Discret. Appl. Math. 250: 186-201 (2018) - 2017
- [j28]Dimitris Magos, Ioannis Mourtos
Submodularity and its application to some global constraints. Ann. Math. Artif. Intell. 79(4): 267-289 (2017) - [j27]Stathis Plitsos
Energy-aware decision support for production scheduling. Decis. Support Syst. 93: 88-97 (2017) - [j26]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Ioannis Mourtos
The social cost of congestion games by imposing variable delays. ICT Express 3(4): 155-159 (2017) - [j25]Trivikram Dokka
Fast separation for the three-index assignment problem. Math. Program. Comput. 9(1): 39-59 (2017) - [c14]Pavlos Eirinakis, Jorge Buenabad-Chávez, Rosanna Fornasiero
A Proposal of Decentralised Architecture for Optimised Operations in Manufacturing Ecosystem Collaboration. PRO-VE 2017: 128-137 - 2016
- [j24]Gautam Appa, Reinhardt Euler, Anastasia Kouvela, Dimitris Magos, Ioannis Mourtos
On the completability of incomplete orthogonal Latin rectangles. Discret. Math. 339(6): 1771-1794 (2016) - [j23]Ioannis Mourtos
Cardinality constraints and systems of restricted representatives. J. Comb. Optim. 31(3): 1061-1089 (2016) - [j22]Katarína Cechlárová
Pareto Optimal Matchings in Many-to-Many Markets with Ties. Theory Comput. Syst. 59(4): 700-721 (2016) - [c13]Stathis Plitsos, Dimitrios Magos, Ioannis Mourtos:
An Integrated Solver for Multi-index Assignment. ISAIM 2016 - [c12]Georgios Zois, Antonios Michaloliakos, Konstantinos Psounis, Vasilis Vassalos, Ioannis Mourtos:
Non-asymptotic performance bounds for downlink MU-MIMO scheduling. WONS 2016: 162-169 - 2015
- [c11]Eleni Zampou, Katerina Pramatari, Ioannis Mourtos:
Design of Environmental Performance Monitoring Systems in the Supply Chain: The Role of Interoperability. ECIS 2015 - [c10]Katarína Cechlárová
Pareto Optimal Matchings in Many-to-Many Markets with Ties. SAGT 2015: 27-39 - [i2]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 abs/1507.02866 (2015) - 2014
- [j21]Eleni Zampou, Stathis Plitsos, Angeliki Karagiannaki, Ioannis Mourtos
Towards a framework for energy-aware information systems in manufacturing. Comput. Ind. 65(3): 419-433 (2014) - [j20]Katarína Cechlárová
Pareto optimality in many-to-many matching problems. Discret. Optim. 14: 160-169 (2014) - [j19]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Polyhedral Aspects of Stable Marriage. Math. Oper. Res. 39(3): 656-671 (2014) - [j18]Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
From One Stable Marriage to the Next: How Long Is the Way? SIAM J. Discret. Math. 28(4): 1971-1979 (2014) - [j17]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Blockers and antiblockers of stable matchings. Theor. Comput. Sci. 524: 126-133 (2014) - [i1]Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Yiannis Mourtos, Maria J. Serna:
Optimizing the Social Cost of Congestion Games by Imposing Variable Delays. CoRR abs/1406.5153 (2014) - 2013
- [c9]Ioannis Mourtos
Tight LP-Relaxations of Overlapping Global Cardinality Constraints. CPAIOR 2013: 362-368 - 2012
- [j16]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem. INFORMS J. Comput. 24(2): 245-259 (2012) - [j15]Dimitris Magos, Ioannis Mourtos
A polyhedral approach to the alldifferent system. Math. Program. 132(1-2): 209-260 (2012) - [c8]Trivikram Dokka, Ioannis Mourtos
Fast Separation Algorithms for Three-Index Assignment Problems. ISCO 2012: 189-200 - 2011
- [j14]Dimitris Magos, Ioannis Mourtos
On the Facial Structure of the Alldifferent System. SIAM J. Discret. Math. 25(1): 130-158 (2011)
2000 – 2009
- 2009
- [j13]Dimitris Magos, Ioannis Mourtos
Persistency and matroid intersection. Comput. Manag. Sci. 6(4): 435-445 (2009) - [j12]Dimitris Magos, Ioannis Mourtos
Clique facets of the axial and planar assignment polytopes. Discret. Optim. 6(4): 394-413 (2009) - [j11]Konstantinos Kounetas, Ioannis Mourtos
Efficiency decompositions for heterogeneous technologies. Eur. J. Oper. Res. 199(1): 209-218 (2009) - [p1]Ioannis Mourtos
An Artificial Market for Emission Permits. Tools and Applications with Artificial Intelligence 2009: 69-76 - 2008
- [j10]Dimitris Magos, Ioannis Mourtos
The wheels of the OLS polytope: Facets and separation. Discret. Math. 308(16): 3634-3651 (2008) - [c7]Athanasios P. Kalogeras
Integrated real-time system for perishable freight transport management. ETFA 2008: 21-24 - 2007
- [c6]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Hyperarc Consistency for the Stable Admissions Problem. ICTAI (1) 2007: 239-242 - [c5]George Asimakopoulos, Ioannis Mourtos
A real time RFID enhanced haulage monitoring system. MobiMedia 2007: 64 - [c4]Angeliki Karagiannaki, Ioannis Mourtos, Katerina Pramatari:
Simulating and evaluating the impact of RFID on warehousing operations: a case study. SCSC 2007: 34 - 2006
- [j9]Gautam Appa, Dimitris Magos, Ioannis Mourtos
A new class of facets for the Latin square polytope. Discret. Appl. Math. 154(6): 900-911 (2006) - [j8]Gautam Appa, Dimitris Magos, Ioannis Mourtos
On the orthogonal Latin squares polytope. Discret. Math. 306(2): 171-187 (2006) - [j7]Gautam Appa, Dimitris Magos, Ioannis Mourtos
Searching for Mutually Orthogonal Latin Squares via integer and constraint programming. Eur. J. Oper. Res. 173(2): 519-530 (2006) - [j6]Dimitris Magos, Ioannis Mourtos
The Matching Predicate and a Filtering Scheme Based on Matroids. J. Comput. 1(6): 37-42 (2006) - [c3]Dimitris Magos, Ioannis Mourtos
Consistency of the Matching Predicate. SETN 2006: 555-558 - 2005
- [j5]Gautam Appa, Dimitris Magos, Ioannis Mourtos
On the system of two all_different predicates. Inf. Process. Lett. 94(3): 99-105 (2005) - [j4]Gautam Appa, Dimitris Magos, Ioannis Mourtos
The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities. J. Comb. Optim. 10(4): 365-389 (2005) - 2004
- [j3]Gautam Appa, Dimitrios Magos, Ioannis Mourtos
A Branch & Cut algorithm for a four-index assignment problem. J. Oper. Res. Soc. 55(3): 298-307 (2004) - [j2]Konstantinos Antonis
A hierarchical adaptive distributed algorithm for load balancing. J. Parallel Distributed Comput. 64(1): 151-162 (2004) - [j1]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): 336-344 (2004) - [c2]Gautam Appa, Dimitris Magos, Ioannis Mourtos
LP Relaxations of Multiple all_different Predicates. CPAIOR 2004: 364-369 - 2002
- [c1]Gautam Appa, Ioannis Mourtos
Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. CP 2002: 17-32
Coauthor Index
aka: Dimitrios Magos
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: