default search action
Matthias Ehrgott
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j69]Fotios Petropoulos
, Gilbert Laporte, Emel Aktas
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - 2023
- [j68]Jauny, Debdas Ghosh, Qamrul Hasan Ansari, Matthias Ehrgott
An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems. Comput. Oper. Res. 155: 106236 (2023) - [j67]Edwin Reynolds, Matthias Ehrgott
An evaluation of the fairness of railway timetable rescheduling in the presence of competition between train operators. J. Rail Transp. Plan. Manag. 26: 100389 (2023) - 2022
- [j66]Matthias Ehrgott, Alexander Engau, Margaret M. Wiecek:
Theory, computation, and practice of multiobjective optimisation. Ann. Oper. Res. 319(2): 1477-1478 (2022) - [j65]Guillermo Cabrera-Guerrero
Bi-objective optimisation over a set of convex sub-problems. Ann. Oper. Res. 319(2): 1507-1532 (2022) - [j64]Andrea Raith
Integrating Data Envelopment Analysis into radiotherapy treatment planning for head and neck cancer patients. Eur. J. Oper. Res. 296(1): 289-303 (2022)
2010 – 2019
- 2019
- [j63]Sune Lauth Gadegaard
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets. INFORMS J. Comput. 31(4): 790-804 (2019) - 2018
- [j62]Davaatseren Baatar, Matthias Ehrgott
Minimizing the number of apertures in multileaf collimator sequencing with field splitting. Discret. Appl. Math. 250: 87-103 (2018) - [j61]Matthias Ehrgott
Uncertain Data Envelopment Analysis. Eur. J. Oper. Res. 268(1): 231-242 (2018) - [j60]Guillermo Cabrera-Guerrero
Pareto local search algorithms for the multi-objective beam angle optimisation problem. J. Heuristics 24(2): 205-238 (2018) - [j59]Guillermo Cabrera-Guerrero
A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy. Int. Trans. Oper. Res. 25(1): 243-268 (2018) - 2017
- [j58]Kuan-Min Lin
Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes. 4OR 15(4): 331-357 (2017) - [j57]Antony E. Phillips, Cameron G. Walker
Integer programming for minimal perturbation problems in university course timetabling. Ann. Oper. Res. 252(2): 283-304 (2017) - [j56]Matthias Ehrgott, Ivana Ljubic
Feature cluster: Recent advances in exact methods for multi-objective optimisation. Eur. J. Oper. Res. 260(3): 805-806 (2017) - [j55]Lizhen Shao, Matthias Ehrgott:
Re. "Discrete Representation of Non-dominated Sets in Multi-objective Linear Programming" [European Journal of Operational Research 255 (2016) 687-698]. Eur. J. Oper. Res. 260(3): 828 (2017) - 2016
- [j54]Lizhen Shao, Matthias Ehrgott:
Discrete representation of non-dominated sets in multi-objective linear programming. Eur. J. Oper. Res. 255(3): 687-698 (2016) - [j53]Olga Perederieieva, Matthias Ehrgott
Numerical stability of path-based algorithms for traffic assignment. Optim. Methods Softw. 31(1): 53-67 (2016) - [i3]Fritz Bökler, Matthias Ehrgott, Christopher Morris, Petra Mutzel:
Output-sensitive Complexity of Multiobjective Combinatorial Optimization. CoRR abs/1610.07204 (2016) - 2015
- [j52]Antony E. Phillips
Integer programming methods for large-scale practical classroom assignment problems. Comput. Oper. Res. 53: 42-53 (2015) - [j51]Olga Perederieieva, Matthias Ehrgott
A framework for and empirical study of algorithms for traffic assignment. Comput. Oper. Res. 54: 90-107 (2015) - [j50]Lara Turner, Matthias Ehrgott, Horst W. Hamacher:
On the generality of the greedy algorithm for solving matroid base problems. Discret. Appl. Math. 195: 114-128 (2015) - [j49]Siamak Moradi
A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem. Eur. J. Oper. Res. 244(2): 369-378 (2015) - 2014
- [j48]Andrea Raith
Solving multi-objective traffic assignment. Ann. Oper. Res. 222(1): 483-516 (2014) - [j47]Augusto Eusébio, José Rui Figueira
On finding representative non-dominated points for bi-objective integer network flow problems. Comput. Oper. Res. 48: 1-10 (2014) - [j46]Matthias Ehrgott, Jonas Ide, Anita Schöbel:
Minmax robustness for multi-objective optimization problems. Eur. J. Oper. Res. 239(1): 17-31 (2014) - [j45]Lizhen Shao, Matthias Ehrgott:
An objective space cut and bound algorithm for convex multiplicative programmes. J. Glob. Optim. 58(4): 711-728 (2014) - [j44]Guillermo Cabrera-Guerrero
Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy. Oper. Res. Lett. 42(4): 268-272 (2014) - 2013
- [j43]Richard Lusby
A set packing inspired method for real-time junction train routing. Comput. Oper. Res. 40(3): 713-724 (2013) - [c7]Abhishek Gupta
Applying Bi-level Multi-Objective Evolutionary Algorithms for Optimizing Composites Manufacturing Processes. EMO 2013: 615-627 - [i2]Lara Turner, Matthias Ehrgott, Horst W. Hamacher:
On the generality of the greedy algorithm for solving matroid problems. CTW 2013: 217-220 - 2012
- [j42]Matthias Ehrgott
A dual variant of Benson's "outer approximation algorithm" for multiple objective linear programming. J. Glob. Optim. 52(4): 757-778 (2012) - [c6]Judith Y. T. Wang, Matthias Ehrgott:
Bi-Objective Network Equilibrium, Traffic Assignment and Road Pricing. OR 2012: 563-568 - 2011
- [j41]Matthias Ehrgott
An approximation algorithm for convex multi-objective programming problems. J. Glob. Optim. 50(3): 397-416 (2011) - [j40]Bassy Tam, Matthias Ehrgott
A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling. OR Spectr. 33(1): 49-75 (2011) - [j39]Richard Lusby
Railway track allocation: models and methods. OR Spectr. 33(4): 843-883 (2011) - [j38]Richard Lusby
Routing Trains Through Railway Junctions: A New Set-Packing Approach. Transp. Sci. 45(2): 228-245 (2011) - [c5]Lizhen Shao, Matthias Ehrgott:
An approximation algorithm for convex multiplicative programming problems. MCDM 2011: 175-181 - 2010
- [j37]Matthias Ehrgott
Mathematical optimization in intensity modulated radiation therapy. Ann. Oper. Res. 175(1): 309-365 (2010) - [j36]Oliver Weide, David M. Ryan, Matthias Ehrgott
An iterative approach to robust and integrated aircraft routing and crew scheduling. Comput. Oper. Res. 37(5): 833-844 (2010) - [j35]Anthony Przybylski
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discret. Optim. 7(3): 149-165 (2010) - [j34]Anthony Przybylski
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme. INFORMS J. Comput. 22(3): 371-386 (2010) - [j33]Richard Martin Lusby
An exact method for the double TSP with multiple stacks. Int. Trans. Oper. Res. 17(5): 637-652 (2010) - [e3]Matthias Ehrgott, José Rui Figueira, Salvatore Greco:
Trends in Multiple Criteria Decision Analysis. Springer 2010, ISBN 978-1-4419-5903-4 [contents] - [e2]Matthias Ehrgott, Boris Naujoks, Theodor J. Stewart, Jyrki Wallenius:
Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems - Proceedings of the 19th International Conference on Multiple Criteria Decision Making, Auckland, New Zealand, January 7-12, 2008. Lecture notes in economics and mathematical systems 634, Springer 2010, ISBN 978-3-642-04044-3 [contents]
2000 – 2009
- 2009
- [j32]Augusto Eusébio
A primal-dual simplex algorithm for bi-objective network flow problems. 4OR 7(3): 255-273 (2009) - [j31]Andrea Raith
A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4): 1299-1331 (2009) - [j30]Andrea Raith
A two-phase algorithm for the biobjective integer minimum cost flow problem. Comput. Oper. Res. 36(6): 1945-1954 (2009) - [j29]Matthias Ehrgott
Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization. INFOR Inf. Syst. Oper. Res. 47(1): 31-42 (2009) - [j28]Daniele Pretolani, Lars Relund Nielsen
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. Oper. Res. Lett. 37(3): 201-205 (2009) - [e1]Matthias Ehrgott, Carlos M. Fonseca
Evolutionary Multi-Criterion Optimization, 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings. Lecture Notes in Computer Science 5467, Springer 2009, ISBN 978-3-642-01019-4 [contents] - [i1]Matthias Ehrgott, Jussi Hakanen, Hisao Ishibuchi, Andreas Löhne, Mariano Luque, Kaisa Miettinen, Wlodzimierz Ogryczak, Olexandr Romanko, Theodor J. Stewart, Andrzej P. Wierzbicki:
09041 Working Group 4: MCDM and RIMO. Hybrid and Robust Approaches to Multiobjective Optimization 2009 - 2008
- [j27]Matthias Ehrgott
Mathematical optimization in intensity modulated radiation therapy. 4OR 6(3): 199-262 (2008) - [j26]Matthias Ehrgott:
Multiobjective Optimization. AI Mag. 29(4): 47-57 (2008) - [j25]Matthias Ehrgott, Allen Holder:
Preface. Algorithmic Oper. Res. 3(2) (2008) - [j24]Anthony Przybylski
Two phase algorithms for the bi-objective assignment problem. Eur. J. Oper. Res. 185(2): 509-533 (2008) - [j23]Lizhen Shao, Matthias Ehrgott
Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Math. Methods Oper. Res. 68(2): 257-276 (2008) - [j22]Lizhen Shao, Matthias Ehrgott
Approximating the nondominated set of an MOLP by approximately solving its dual problem. Math. Methods Oper. Res. 68(3): 469-492 (2008) - [j21]Hong Seo Ryoo, Matthias Ehrgott
Biomedical informatics and OR. OR Spectr. 30(2): 219-221 (2008) - [j20]Matthias Ehrgott
Interactive decision support in radiation therapy treatment planning. OR Spectr. 30(2): 311-329 (2008) - [c4]Theodor J. Stewart, Oliver Bandte, Heinrich Braun, Nirupam Chakraborti
Real-World Applications of Multiobjective Optimization. Multiobjective Optimization 2008: 285-327 - [c3]Judith Y. T. Wang, Andrea Raith
Tolling Analysis with Bi-objective Traffic Assignment. MCDM 2008: 117-129 - [p1]Matthias Ehrgott, Xavier Gandibleux
Hybrid Metaheuristics for Multi-objective Combinatorial Optimization. Hybrid Metaheuristics 2008: 221-259 - 2007
- [j19]Matthias Ehrgott, Xavier Gandibleux
Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9): 2674-2694 (2007) - [j18]Matthias Ehrgott:
Review of "Vector Optimization" by Johannes Jahn. Eur. J. Oper. Res. 178(2): 639-642 (2007) - [c2]Lizhen Shao, Matthias Ehrgott:
Finding Representative Nondominated Points in Multiobjective Linear Programming. MCDM 2007: 245-252 - 2006
- [j17]Matthias Ehrgott, José Rui Figueira
Preface. Ann. Oper. Res. 147(1): 1-3 (2006) - [j16]Matthias Ehrgott:
A discussion of scalarization techniques for multiple objective integer programming. Ann. Oper. Res. 147(1): 343-360 (2006) - [j15]Anthony Przybylski
The biobjective integer minimum cost flow problem - incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm. Comput. Oper. Res. 33: 1459-1463 (2006) - [j14]Maurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher, Francesco Maffioli:
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discret. Appl. Math. 154(9): 1344-1357 (2006) - 2005
- [b1]Matthias Ehrgott:
Multicriteria Optimization (2. ed.). Springer 2005, ISBN 978-3-540-21398-7, pp. I-XIII, 1-323 - [j13]Horst W. Hamacher, Matthias Ehrgott:
Special section: Using discrete mathematics to model multileaf collimators in radiation therapy. Discret. Appl. Math. 152(1-3): 4-5 (2005) - [j12]Davaatseren Baatar
Decomposition of integer matrices and multileaf collimator sequencing. Discret. Appl. Math. 152(1-3): 6-34 (2005) - [j11]Matthias Ehrgott, Margaret M. Wiecek:
Saddle Points and Pareto Points in Multiple Objective Programming. J. Glob. Optim. 32(1): 11-33 (2005) - [c1]Xavier Gandibleux
1984-2004 - 20 Years of Multiobjective Metaheuristics. But What About the Solution of Combinatorial Problems with Multiple Objectives?. EMO 2005: 33-46 - 2004
- [j10]Maurizio Bruglieri, Francesco Maffioli, Matthias Ehrgott:
Cardinality constrained minimum cut problems: complexity and algorithms. Discret. Appl. Math. 137(3): 311-341 (2004) - [j9]Matthias Ehrgott, Kathrin Klamroth
An MCDM approach to portfolio optimization. Eur. J. Oper. Res. 155(3): 752-770 (2004) - 2003
- [j8]Christian Blum
Local Search Algorithms for the k-cardinality Tree Problem. Discret. Appl. Math. 128(2-3): 511-540 (2003) - [j7]Matthias Ehrgott, Anders J. V. Skriver:
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach. Eur. J. Oper. Res. 147(3): 657-664 (2003) - [j6]Matthias Ehrgott, Dagmar Tenfelde-Podehl:
Computation of ideal and Nadir values and implications for their use in MCDM methods. Eur. J. Oper. Res. 151(1): 119-139 (2003) - [j5]Matthias Ehrgott:
Book Reviews. Math. Methods Oper. Res. 58(2): 351-358 (2003) - [j4]Matthias Ehrgott, Rick Johnston:
Optimisation of beam directions in intensity modulated radiation therapy planning. OR Spectr. 25(2): 251-264 (2003) - 2002
- [j3]Matthias Ehrgott, Stefan Nickel:
On the number of criteria needed to decide Pareto optimality. Math. Methods Oper. Res. 55(3): 329-345 (2002) - 2000
- [j2]Matthias Ehrgott, Xavier Gandibleux
A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectr. 22(4): 425-460 (2000)
1990 – 1999
- 1999
- [j1]Matthias Ehrgott, Horst W. Hamacher, Stefan Nickel:
Geometric Methods to Solve Max-Ordering Location Problems. Discret. Appl. Math. 93(1): 3-20 (1999)
Coauthor Index
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-10-07 21:15 CEST 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: