Hochschulschrift
Low dimensional 0,1-polytopes and branch-and-cut in combinatorial optimization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783826532771
3826532775
- Maße
-
21 cm
- Umfang
-
IX, 150 S.
- Ausgabe
-
Als Ms. gedr.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Zugl.: Heidelberg, Univ., Diss., 1997
- Schlagwort
-
Polytop
Kombinatorische Optimierung
Branch-and-Cut-Methode
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:48 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.
Objekttyp
- Hochschulschrift
Beteiligte
- Christof, Thomas
- Shaker
Entstanden
- 1997
Ähnliche Objekte (12)
Undominated complexes of cut polytopes
Extended formulations for combinatorial polytopes
Adjacency on polytopes in combinatorial optimization
Polytopes with few coordinate values : combinatorial types and diameter bounds
Extended formulations for higher order polytopes in combinatorial optimization
Polytopes and Scheduling
Contributions to branch-and-price-and-cut algorithms for routing problems
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Non-flat regular polytopes and restrictions on chiral polytopes
Representation theory and polytopes
Representation theory and polytopes
Polytopes - combinatorics and computation
Undominated complexes of cut polytopes
Extended formulations for combinatorial polytopes
Adjacency on polytopes in combinatorial optimization
Polytopes with few coordinate values : combinatorial types and diameter bounds
Extended formulations for higher order polytopes in combinatorial optimization
Polytopes and Scheduling
Contributions to branch-and-price-and-cut algorithms for routing problems
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Non-flat regular polytopes and restrictions on chiral polytopes
Representation theory and polytopes
Representation theory and polytopes
Polytopes - combinatorics and computation
Undominated complexes of cut polytopes
Extended formulations for combinatorial polytopes
Adjacency on polytopes in combinatorial optimization
Polytopes with few coordinate values : combinatorial types and diameter bounds
Extended formulations for higher order polytopes in combinatorial optimization
Polytopes and Scheduling
Contributions to branch-and-price-and-cut algorithms for routing problems
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Non-flat regular polytopes and restrictions on chiral polytopes
Representation theory and polytopes
Representation theory and polytopes