- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Dortmund, Technische Universität, Dissertation, 2020
- Keyword
-
Combinatorial optimization
Kombinatorische Optimierung
Robuste Optimierung
Matching
Effizienter Algorithmus
Berechnungskomplexität
- Event
-
Veröffentlichung
- (where)
-
Dortmund
- (who)
-
Universitätsbibliothek Dortmund
- (when)
-
2020
- Creator
- Contributor
-
Buchheim, Christoph
Stiller, Sebastian
- Handle
-
2003/39782
- URN
-
urn:nbn:de:101:1-2020102303420925906211
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
16.08.2025, 2:26 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
- Hommelsheim, Felix
- Buchheim, Christoph
- Stiller, Sebastian
- Universitätsbibliothek Dortmund
Time of origin
- 2020
Other Objects (12)
Min-max-min robust combinatorial optimization
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Robust combinatorial optimization problems under budgeted interdiction uncertainty
An oracle-based framework for robust combinatorial optimization
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Combinatorial optimization :
Combinatorial optimization :
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
Complexity of near-optimal robust versions of multilevel optimization problems
Min-max-min robust combinatorial optimization
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Robust combinatorial optimization problems under budgeted interdiction uncertainty
An oracle-based framework for robust combinatorial optimization
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Combinatorial optimization :
Combinatorial optimization :
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
Complexity of near-optimal robust versions of multilevel optimization problems
Min-max-min robust combinatorial optimization
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Robust combinatorial optimization problems under budgeted interdiction uncertainty
An oracle-based framework for robust combinatorial optimization
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Combinatorial optimization :
Combinatorial optimization :
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty