Disjunctive Programming
Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Cham :
Springer International Publishing : Imprint: Springer,
2018.
|
Έκδοση: | 1st ed. 2018. |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 1 Disjunctive programming and its relation to integer programming
- 2 The convex hull of a disjunctive set
- 3 Sequential convexification of disjunctive sets
- 4 Moving between conjunctive and disjunctive normal forms
- 5 Disjunctive programming and extended formulations
- 6 Lift-and-project cuts for mixed 0-1 programs
- 7 Nonlinear higher-dimensional representations
- 8 The correspondence between lift-and-project cuts and simple disjunctive cuts
- 9 Solving (CGLP)k on the LP simplex tableau
- 10 Implementation and testing of variants
- 11 Cuts from general disjunctions
- 12 Disjunctive cuts from the V -polyhedral representation
- 13 Unions of polytopes in different spaces
- References.