Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty ; day:29 ; month:8 ; year:2024 ; pages:1-50
Mathematical programming ; (29.8.2024), 1-50
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10107-024-02135-7
- URN
-
urn:nbn:de:101:1-2411250858478.425804952604
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:20 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
- Büsing, Christina
- Gersing, Timo
- Koster, Arie M.C.A.
- SpringerLink (Online service)
Other Objects (12)
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Supermodularity and valid inequalities for quadratic optimization with indicators
Min-max-min robust combinatorial optimization
Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares
Complexity of bulk-robust combinatorial optimization problems
Derandomizing Concentration Inequalities with dependencies and their combinatorial applications
A new class of valid inequalities for the round robin tournament problem
Robust combinatorial optimization problems under budgeted interdiction uncertainty
Solution Methods for Multi-Objective Robust Combinatorial Optimization
An oracle-based framework for robust combinatorial optimization
From Valid Measurements to Valid Mini-Apps
Robust MPC via min-max differential inequalities
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Supermodularity and valid inequalities for quadratic optimization with indicators
Min-max-min robust combinatorial optimization
Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares
Complexity of bulk-robust combinatorial optimization problems
Derandomizing Concentration Inequalities with dependencies and their combinatorial applications
A new class of valid inequalities for the round robin tournament problem
Robust combinatorial optimization problems under budgeted interdiction uncertainty
Solution Methods for Multi-Objective Robust Combinatorial Optimization
An oracle-based framework for robust combinatorial optimization
From Valid Measurements to Valid Mini-Apps
Robust MPC via min-max differential inequalities
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Supermodularity and valid inequalities for quadratic optimization with indicators
Min-max-min robust combinatorial optimization
Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares
Complexity of bulk-robust combinatorial optimization problems
Derandomizing Concentration Inequalities with dependencies and their combinatorial applications
A new class of valid inequalities for the round robin tournament problem
Robust combinatorial optimization problems under budgeted interdiction uncertainty
Solution Methods for Multi-Objective Robust Combinatorial Optimization
An oracle-based framework for robust combinatorial optimization
From Valid Measurements to Valid Mini-Apps