- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2878
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Tight Convex Relaxations for the Expansion Planning Problem ; volume:194 ; number:1 ; day:22 ; month:4 ; year:2022 ; pages:325-352 ; date:7.2022
Journal of optimization theory and applications ; 194, Heft 1 (22.4.2022), 325-352, 7.2022
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10957-022-02029-8
- URN
-
urn:nbn:de:101:1-2022073108433823765442
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:29 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
- Lenz, Ralf
- Serrano Musalem, Felipe
- SpringerLink (Online service)
Ähnliche Objekte (12)
Convex Relaxations of Componentwise Convex Functions
Convex relaxations for mixed-integer nonlinear programs
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
New convex relaxations and global optimality in variational imaging
New Convex Relaxations and Global Optimality in Variational Imaging
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Splits and tight spans of convex polytopes
Relaxations
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Second-order cone AC optimal power flow: convex relaxations and feasible solutions
Convex Relaxations of Componentwise Convex Functions
Convex relaxations for mixed-integer nonlinear programs
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
New convex relaxations and global optimality in variational imaging
New Convex Relaxations and Global Optimality in Variational Imaging
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Splits and tight spans of convex polytopes
Relaxations
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Second-order cone AC optimal power flow: convex relaxations and feasible solutions
Convex Relaxations of Componentwise Convex Functions
Convex relaxations for mixed-integer nonlinear programs
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
New convex relaxations and global optimality in variational imaging
New Convex Relaxations and Global Optimality in Variational Imaging
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Splits and tight spans of convex polytopes
Relaxations
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints