- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2916
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
An approximation algorithm for convex multi-objective programming problems ; volume:50 ; number:3 ; day:17 ; month:8 ; year:2010 ; pages:397-416 ; date:7.2011
Journal of global optimization ; 50, Heft 3 (17.8.2010), 397-416, 7.2011
- Creator
-
Ehrgott, Matthias
Shao, Lizhen
Schöbel, Anita
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10898-010-9588-7
- URN
-
urn:nbn:de:101:1-2021083022575754886355
- Rights
-
Open Access; 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
- Ehrgott, Matthias
- Shao, Lizhen
- Schöbel, Anita
- SpringerLink (Online service)
Other Objects (12)
Locating lines and hyperplanes : theory and algorithms
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Algorithms and decomposition methods for multiobjective location and approximation problems
Concepts of Robustness for Uncertain Multi-Objective Optimization
Locating stops along bus or railway lines - a bicriterial problem
Integer programming approaches for solving the delay management problem
Solving restricted line location problems via a dual interpretation
Locating Least-Distant Lines in the Plane
Anchored hyperplane location problems
The relationship between multi-objective robustness concepts and set-valued optimization
On Minmax Robustness for Multiobjective Optimization with Decision or Parameter Uncertainty
Evolution und Epidemie : Spieltheorie in der Biophysik
Locating lines and hyperplanes : theory and algorithms
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Algorithms and decomposition methods for multiobjective location and approximation problems
Concepts of Robustness for Uncertain Multi-Objective Optimization
Locating stops along bus or railway lines - a bicriterial problem
Integer programming approaches for solving the delay management problem
Solving restricted line location problems via a dual interpretation
Locating Least-Distant Lines in the Plane
Anchored hyperplane location problems
The relationship between multi-objective robustness concepts and set-valued optimization
On Minmax Robustness for Multiobjective Optimization with Decision or Parameter Uncertainty
Evolution und Epidemie : Spieltheorie in der Biophysik
Locating lines and hyperplanes : theory and algorithms
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Algorithms and decomposition methods for multiobjective location and approximation problems
Concepts of Robustness for Uncertain Multi-Objective Optimization
Locating stops along bus or railway lines - a bicriterial problem
Integer programming approaches for solving the delay management problem
Solving restricted line location problems via a dual interpretation
Locating Least-Distant Lines in the Plane
Anchored hyperplane location problems
The relationship between multi-objective robustness concepts and set-valued optimization
On Minmax Robustness for Multiobjective Optimization with Decision or Parameter Uncertainty