Approximating biobjective minimization problems using general ordering cones

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource, 1 online resource.

Language: Englisch

Bibliographic citation: 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

Creator: Herzel, Arne
Helfrich, Stephan
Ruzika, Stefan
Thielen, Clemens

Contributor: SpringerLink (Online service)

DOI: 10.1007/s10898-023-01276-x

URN: urn:nbn:de:101:1-2023090909354338806592

Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:56 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Herzel, Arne
Helfrich, Stephan
Ruzika, Stefan
Thielen, Clemens
SpringerLink (Online service)

Other Objects (12)

Approximating Multistage Matching Problems

Artikel

Approximating the product knapsack problem

Approximating Perpetuities

Arbeitspapier

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 solution structure

Approximating Walrasian Equilibria

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

Artikel

Approximating the product knapsack problem

Approximating Perpetuities

Arbeitspapier

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 solution structure

Approximating Walrasian Equilibria

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

Artikel

Approximating the product knapsack problem

Approximating Perpetuities

Arbeitspapier

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 solution structure

Approximating Walrasian Equilibria

Approximating least fixpoints

The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Approximating biobjective minimization problems using general ordering cones

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (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 solution structure

Approximating Walrasian Equilibria

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 solution structure

Approximating Walrasian Equilibria

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 solution structure

Approximating Walrasian Equilibria

Approximating least fixpoints

The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones

Related objects

Reset password