- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Dortmund, Technische Universität, Dissertation, 2020
- Schlagwort
-
Combinatorial optimization
Kombinatorische Optimierung
Robuste Optimierung
Matching
Effizienter Algorithmus
Berechnungskomplexität
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Universitätsbibliothek Dortmund
- (wann)
-
2020
- Urheber
- Beteiligte Personen und Organisationen
-
Buchheim, Christoph
Stiller, Sebastian
- Handle
-
2003/39782
- URN
-
urn:nbn:de:101:1-2020102303420925906211
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:26 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
- Hommelsheim, Felix
- Buchheim, Christoph
- Stiller, Sebastian
- Universitätsbibliothek Dortmund
Entstanden
- 2020
Ähnliche Objekte (12)
Min-max-min robust combinatorial optimization
Robust combinatorial optimization problems under budgeted interdiction uncertainty
Solution Methods for Multi-Objective Robust Combinatorial Optimization
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
Robust combinatorial optimization problems under budgeted interdiction uncertainty
Solution Methods for Multi-Objective Robust Combinatorial Optimization
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
Robust combinatorial optimization problems under budgeted interdiction uncertainty
Solution Methods for Multi-Objective Robust Combinatorial Optimization
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