Approximating biobjective minimization problems using general ordering cones
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
Approximating biobjective minimization problems using general ordering cones ; volume:86 ; number:2 ; day:6 ; month:3 ; year:2023 ; pages:393-415 ; date:6.2023
Journal of global optimization ; 86, Heft 2 (6.3.2023), 393-415, 6.2023
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10898-023-01276-x
- URN
-
urn:nbn:de:101:1-2023090909354338806592
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:56 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
- Herzel, Arne
- Helfrich, Stephan
- Ruzika, Stefan
- Thielen, Clemens
- SpringerLink (Online service)
Ähnliche Objekte (12)
Approximating Multistage Matching Problems
Approximating the product knapsack problem
Approximating the product knapsack problem
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Extragradient method for convex minimization problem
Approximating the probabilistic p-Center problem under pressure
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints
The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
Approximating Multistage Matching Problems
Approximating the product knapsack problem
Approximating the product knapsack problem
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Extragradient method for convex minimization problem
Approximating the probabilistic p-Center problem under pressure
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints
The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
Approximating Multistage Matching Problems
Approximating the product knapsack problem
Approximating the product knapsack problem
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Extragradient method for convex minimization problem
Approximating the probabilistic p-Center problem under pressure
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints