- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2878
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10957-022-02029-8
- URN
-
urn:nbn:de:101:1-2022073108433823765442
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:29 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
- Lenz, Ralf
- Serrano Musalem, Felipe
- SpringerLink (Online service)
Other Objects (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
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Relaxations
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
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Relaxations
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
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Relaxations