Solving an integer programming problem

Solving an integer programming problem

We consider a sequence of master (zero-one integer programming) problems arising from the application of Benders decomposition to mixed integer programming models. This sequence of related problems was solved by reoptimization using implicit enumeration based algorithms for postoptimizing zero-one p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Hoc, Hoang Hai
Format: Buchkapitel
Sprache:eng
Schlagworte:
Bender Decomposition
Integer Programming
Integer Programming Problem
Master Problem
Partial Solution
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a sequence of master (zero-one integer programming) problems arising from the application of Benders decomposition to mixed integer programming models. This sequence of related problems was solved by reoptimization using implicit enumeration based algorithms for postoptimizing zero-one programs. Both computational experience and results are reported.
ISSN:0170-8643
1610-7411
DOI:10.1007/BFb0006525