Ehrgott Matthias

Matthias Ehrgott

Information about the author Matthias Ehrgott will soon be added to the site.
Found 33 papers in total
Output-sensitive complexity of multiobjective combinatorial optimization
Output-sensitive complexity of multiobjective combinatorial optimization
2017
We study output‐sensitive algorithms and complexity for multiobjective...
Navigation in multiobjective optimization methods
Navigation in multiobjective optimization methods
2017
Building on previous work of the authors, this paper formally defines and reviews the...
On multi-objective stochastic user equilibrium
On multi-objective stochastic user equilibrium
2015
There is extensive empirical evidence that travellers consider many qualities (travel...
Multi-objective Approaches to the Unit Crewing Problem in Airline Crew Scheduling
Multi-objective Approaches to the Unit Crewing Problem in Airline Crew Scheduling
2014
The goal of the crew pairing problem is to partition a flight schedule into sequences...
A set packing inspired method for real‐time junction train routing
A set packing inspired method for real‐time junction train routing
2013
Efficiently coordinating the often large number of interdependent, timetabled train...
A bi‐objective cyclist route choice model
A bi‐objective cyclist route choice model
2012
It is widely acknowledged that cyclists choose their route differently to drivers of...
A dual variant of Benson’s ‘outer approximation algorithm’ for multiple objective linear programming
A dual variant of Benson’s ‘outer approximation algorithm’ for multiple objective linear programming
2012
Outcome space methods construct the set of nondominated points in the objective...
On Vector Equilibria, Vector Optimization and Vector Variational Inequalities
On Vector Equilibria, Vector Optimization and Vector Variational Inequalities
2011
It is well-known that, under certain conditions, network equilibrium, optimization and...
An approximation algorithm for convex multi‐objective programming problems
An approximation algorithm for convex multi‐objective programming problems
2011
In multi‐objective convex optimization it is necessary to compute an infinite...
Railway track allocation: models and methods
Railway track allocation: models and methods
2011
Efficiently coordinating the movement of trains on a railway network is a central part...
Routing Trains Through Railway Junctions: A New Set‐Packing Approach
Routing Trains Through Railway Junctions: A New Set‐Packing Approach
2011
The problem of routing trains through railway junctions is an integral part of railway...
A comparison of stochastic programming and bi‐objective optimisation approaches to robust airline crew scheduling
A comparison of stochastic programming and bi‐objective optimisation approaches to robust airline crew scheduling
2011
A prominent problem in airline crew scheduling is the pairings or...
An exact method for the double TSP with multiple stacks
An exact method for the double TSP with multiple stacks
2010
The double travelling salesman problem (TSP) with multiple stacks (DTSPMS) is a pickup...
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
2010
In this paper, we present two versions of an algorithm for the computation of all...
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
2009
We compare two different models for multicriterion routing in stochastic...
Mathematical optimization in intensity modulated radiation therapy
Mathematical optimization in intensity modulated radiation therapy
2010
The design of an intensity modulated radiotherapy treatment includes the selection of...
Bound sets for biobjective combinatorial optimization problems
Bound sets for biobjective combinatorial optimization problems
2007
In this paper we introduce the concept of bound sets for multiobjective discrete...
The biobjective integer minimum cost flow problem – incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
The biobjective integer minimum cost flow problem – incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
2006
In this paper, we show with a counterexample, that the method proposed by...
A discussion of scalarization techniques for multiple objective integer programming
A discussion of scalarization techniques for multiple objective integer programming
2006
In this paper we consider solution methods for multiobjective integer programming...
Location of rescue helicopters in South Tyrol
Location of rescue helicopters in South Tyrol
2002
In this case study we analyse the positioning of rescue helicopters in the South Tyrol...
Saddle points and Pareto points in multiple objective programming
Saddle points and Pareto points in multiple objective programming
2005
In this paper relationships between Pareto points and saddle points are studied in...
Constructing robust crew schedules with bicriteria optimization
Constructing robust crew schedules with bicriteria optimization
2002
Optimization-based computer systems are used by many airlines to solve crew planning...
A multiple criteria decision method approach to portfolio optimization
A multiple criteria decision method approach to portfolio optimization
2004
We propose a model for portfolio optimization extending the Markowitz...
Computation of ideal and Nadir values and implications for their use in multiple-criteria decision making methods
Computation of ideal and Nadir values and implications for their use in multiple-criteria decision making methods
2003
in this paper we investigate the problem of finding the Nadir point for multicriteria...
Papers per page: