Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Dortmund, Technische Universität, Dissertation, 2018
- Klassifikation
-
Mathematik
- Schlagwort
-
Combinatorial optimization
Mehrkriterielle Optimierung
Komplexitätstheorie
Lineare Optimierung
Kürzester-Weg-Problem
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Universitätsbibliothek Dortmund
- (wann)
-
2018
- Urheber
- Beteiligte Personen und Organisationen
- Handle
-
2003/37134
- URN
-
urn:nbn:de:101:1-2018092803420588322502
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:30 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bökler, Fritz
- Mutzel, Petra
- Ehrgott, Matthias
- Universitätsbibliothek Dortmund
Entstanden
- 2018
Ähnliche Objekte (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