Hochschulschrift
Generating general-purpose cutting planes for mixed-integer programs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Paderborn, Univ., Diss., 2011
- Urheber
- URN
-
urn:nbn:de:hbz:466-20110315019
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
01.11.2025, 22:51 MEZ
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
Ähnliche Objekte (12)
On cutting planes for mixed-integer nonlinear programming
Maximal lattice-free polyhedra in mixed-integer cutting plane theory
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
Vorlesung 05: Mixed-Integer Programme
Computational mixed-integer semidefinite programming
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
Mixed-integer programming for additive manufacturing
Reducing mixed-integer to zero-one programs
Mixed-integer programming subject to uncertain data
Convex relaxations for mixed-integer nonlinear programs
Tighter relaxations in mixed-integer nonlinear programming
On cutting planes for mixed-integer nonlinear programming
Maximal lattice-free polyhedra in mixed-integer cutting plane theory
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
Vorlesung 05: Mixed-Integer Programme
Computational mixed-integer semidefinite programming
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
Mixed-integer programming for additive manufacturing
Reducing mixed-integer to zero-one programs
Mixed-integer programming subject to uncertain data
Convex relaxations for mixed-integer nonlinear programs
Tighter relaxations in mixed-integer nonlinear programming
On cutting planes for mixed-integer nonlinear programming
Maximal lattice-free polyhedra in mixed-integer cutting plane theory
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
Vorlesung 05: Mixed-Integer Programme
Computational mixed-integer semidefinite programming
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
Mixed-integer programming for additive manufacturing
Reducing mixed-integer to zero-one programs
Mixed-integer programming subject to uncertain data
Convex relaxations for mixed-integer nonlinear programs