Matthias Ehrgott

Orcid: 0000-0003-4648-4066

According to our database1, Matthias Ehrgott authored at least 79 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems.
Comput. Oper. Res., July, 2023

An evaluation of the fairness of railway timetable rescheduling in the presence of competition between train operators.
J. Rail Transp. Plan. Manag., 2023

2022
Integrating Data Envelopment Analysis into radiotherapy treatment planning for head and neck cancer patients.
Eur. J. Oper. Res., 2022

Theory, computation, and practice of multiobjective optimisation.
Ann. Oper. Res., 2022

Bi-objective optimisation over a set of convex sub-problems.
Ann. Oper. Res., 2022

2019
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets.
INFORMS J. Comput., 2019

2018
A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy.
Int. Trans. Oper. Res., 2018

Pareto local search algorithms for the multi-objective beam angle optimisation problem.
J. Heuristics, 2018

Uncertain Data Envelopment Analysis.
Eur. J. Oper. Res., 2018

Minimizing the number of apertures in multileaf collimator sequencing with field splitting.
Discret. Appl. Math., 2018

2017
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., 2017

Feature cluster: Recent advances in exact methods for multi-objective optimisation.
Eur. J. Oper. Res., 2017

Integer programming for minimal perturbation problems in university course timetabling.
Ann. Oper. Res., 2017

Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes.
4OR, 2017

2016
Numerical stability of path-based algorithms for traffic assignment.
Optim. Methods Softw., 2016

Discrete representation of non-dominated sets in multi-objective linear programming.
Eur. J. Oper. Res., 2016

Output-sensitive Complexity of Multiobjective Combinatorial Optimization.
CoRR, 2016

2015
A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem.
Eur. J. Oper. Res., 2015

On the generality of the greedy algorithm for solving matroid base problems.
Discret. Appl. Math., 2015

Integer programming methods for large-scale practical classroom assignment problems.
Comput. Oper. Res., 2015

A framework for and empirical study of algorithms for traffic assignment.
Comput. Oper. Res., 2015

2014
Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy.
Oper. Res. Lett., 2014

An objective space cut and bound algorithm for convex multiplicative programmes.
J. Glob. Optim., 2014

Minmax robustness for multi-objective optimization problems.
Eur. J. Oper. Res., 2014

On finding representative non-dominated points for bi-objective integer network flow problems.
Comput. Oper. Res., 2014

Solving multi-objective traffic assignment.
Ann. Oper. Res., 2014

2013
A set packing inspired method for real-time junction train routing.
Comput. Oper. Res., 2013

Applying Bi-level Multi-Objective Evolutionary Algorithms for Optimizing Composites Manufacturing Processes.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2013

On the generality of the greedy algorithm for solving matroid problems.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
A dual variant of Benson's "outer approximation algorithm" for multiple objective linear programming.
J. Glob. Optim., 2012

Bi-Objective Network Equilibrium, Traffic Assignment and Road Pricing.
Proceedings of the Operations Research Proceedings 2012, 2012

2011
Routing Trains Through Railway Junctions: A New Set-Packing Approach.
Transp. Sci., 2011

A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling.
OR Spectr., 2011

Railway track allocation: models and methods.
OR Spectr., 2011

An approximation algorithm for convex multi-objective programming problems.
J. Glob. Optim., 2011

An approximation algorithm for convex multiplicative programming problems.
Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Multicriteria Decision-Making, 2011

2010
An exact method for the double TSP with multiple stacks.
Int. Trans. Oper. Res., 2010

A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme.
INFORMS J. Comput., 2010

A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives.
Discret. Optim., 2010

An iterative approach to robust and integrated aircraft routing and crew scheduling.
Comput. Oper. Res., 2010

Mathematical optimization in intensity modulated radiation therapy.
Ann. Oper. Res., 2010

2009
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks.
Oper. Res. Lett., 2009

Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization.
INFOR Inf. Syst. Oper. Res., 2009

A two-phase algorithm for the biobjective integer minimum cost flow problem.
Comput. Oper. Res., 2009

A comparison of solution strategies for biobjective shortest path problems.
Comput. Oper. Res., 2009

A primal-dual simplex algorithm for bi-objective network flow problems.
4OR, 2009

09041 Working Group 4: MCDM and RIMO.
Proceedings of the Hybrid and Robust Approaches to Multiobjective Optimization, 18.01., 2009

2008
Hybrid Metaheuristics for Multi-objective Combinatorial Optimization.
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

Biomedical informatics and OR.
OR Spectr., 2008

Interactive decision support in radiation therapy treatment planning.
OR Spectr., 2008

Approximating the nondominated set of an MOLP by approximately solving its dual problem.
Math. Methods Oper. Res., 2008

Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning.
Math. Methods Oper. Res., 2008

Two phase algorithms for the bi-objective assignment problem.
Eur. J. Oper. Res., 2008

Preface.
Algorithmic Oper. Res., 2008

Multiobjective Optimization.
AI Mag., 2008

Tolling Analysis with Bi-objective Traffic Assignment.
Proceedings of the Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, 2008

Real-World Applications of Multiobjective Optimization.
Proceedings of the Multiobjective Optimization, 2008

2007
Review of "Vector Optimization" by Johannes Jahn.
Eur. J. Oper. Res., 2007

Bound sets for biobjective combinatorial optimization problems.
Comput. Oper. Res., 2007

Finding Representative Nondominated Points in Multiobjective Linear Programming.
Proceedings of the IEEE Symposium on Computational Intelligence in Multicriteria Decision Making, 2007

2006
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints.
Discret. Appl. Math., 2006

The biobjective integer minimum cost flow problem - incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm.
Comput. Oper. Res., 2006

Preface.
Ann. Oper. Res., 2006

A discussion of scalarization techniques for multiple objective integer programming.
Ann. Oper. Res., 2006

2005
Saddle Points and Pareto Points in Multiple Objective Programming.
J. Glob. Optim., 2005

Special section: Using discrete mathematics to model multileaf collimators in radiation therapy.
Discret. Appl. Math., 2005

Decomposition of integer matrices and multileaf collimator sequencing.
Discret. Appl. Math., 2005

1984-2004 - 20 Years of Multiobjective Metaheuristics. But What About the Solution of Combinatorial Problems with Multiple Objectives?.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2005

Multicriteria Optimization (2. ed.).
Springer, ISBN: 978-3-540-21398-7, 2005

2004
An MCDM approach to portfolio optimization.
Eur. J. Oper. Res., 2004

Cardinality constrained minimum cut problems: complexity and algorithms.
Discret. Appl. Math., 2004

2003
Optimisation of beam directions in intensity modulated radiation therapy planning.
OR Spectr., 2003

Book Reviews.
Math. Methods Oper. Res., 2003

Computation of ideal and Nadir values and implications for their use in MCDM methods.
Eur. J. Oper. Res., 2003

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach.
Eur. J. Oper. Res., 2003

Local Search Algorithms for the k-cardinality Tree Problem.
Discret. Appl. Math., 2003

2002
On the number of criteria needed to decide Pareto optimality.
Math. Methods Oper. Res., 2002

2000
A survey and annotated bibliography of multiobjective combinatorial optimization.
OR Spectr., 2000

1999
Geometric Methods to Solve Max-Ordering Location Problems.
Discret. Appl. Math., 1999


  Loading...