Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Dortmund, Technische Universität, Dissertation, 2018
- Classification
-
Mathematik
- Keyword
-
Combinatorial optimization
Mehrkriterielle Optimierung
Komplexitätstheorie
Lineare Optimierung
Kürzester-Weg-Problem
- Event
-
Veröffentlichung
- (where)
-
Dortmund
- (who)
-
Universitätsbibliothek Dortmund
- (when)
-
2018
- Creator
- Contributor
- Handle
-
2003/37134
- URN
-
urn:nbn:de:101:1-2018092803420588322502
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 15.08.2025, 7:30 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bökler, Fritz
- Mutzel, Petra
- Ehrgott, Matthias
- Universitätsbibliothek Dortmund
Time of origin
- 2018
Other Objects (12)
New Multiobjective Shortest Path Algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
Ordinal Costs in Multi-objective Combinatorial Optimization
An Annotated Bibliography of Multiobjective Combinatorial Optimization
Solution Methods for Multi-Objective Robust Combinatorial Optimization
A Comparison of Genetic Representations and Initialisation Methods for the Multi-objective Shortest Path Problem on Multigraphs
Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows
Acceleration of Shortest Path and Constrained Shortest Path Computation
A multi-objective approach for PH-graphs with applications to stochastic shortest paths
A multi-objective approach for PH-graphs with applications to stochastic shortest paths
Stochastic local search algorithms for multiobjective combinatorial optimization : methods and analysis
New Multiobjective Shortest Path Algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
Ordinal Costs in Multi-objective Combinatorial Optimization
An Annotated Bibliography of Multiobjective Combinatorial Optimization
Solution Methods for Multi-Objective Robust Combinatorial Optimization
A Comparison of Genetic Representations and Initialisation Methods for the Multi-objective Shortest Path Problem on Multigraphs
Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows
Acceleration of Shortest Path and Constrained Shortest Path Computation
A multi-objective approach for PH-graphs with applications to stochastic shortest paths
A multi-objective approach for PH-graphs with applications to stochastic shortest paths
Stochastic local search algorithms for multiobjective combinatorial optimization : methods and analysis
New Multiobjective Shortest Path Algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
Ordinal Costs in Multi-objective Combinatorial Optimization
An Annotated Bibliography of Multiobjective Combinatorial Optimization
Solution Methods for Multi-Objective Robust Combinatorial Optimization
A Comparison of Genetic Representations and Initialisation Methods for the Multi-objective Shortest Path Problem on Multigraphs
Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows
Acceleration of Shortest Path and Constrained Shortest Path Computation
A multi-objective approach for PH-graphs with applications to stochastic shortest paths
A multi-objective approach for PH-graphs with applications to stochastic shortest paths