Logic-based Benders decomposition

Benders decomposition uses a strategy of ``learning from one's mistakes.'' The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an ``inference dual.'' Solutio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical programming Ročník 96; číslo 1; s. 33 - 60
Hlavní autoři: Hooker, J.N., Ottosson, G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Heidelberg Springer 01.04.2003
Springer Nature B.V
Témata:
Applied sciences
Decomposition
Digital Object Identifier
Exact sciences and technology
Integer programming
Linear programming
Logic
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization
Propositional logic
Constraint satisfaction
Linear programming
Zero one programming
Constrained optimization
Mathematical programming
ISSN:0025-5610, 1436-4646
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Benders decomposition uses a strategy of ``learning from one's mistakes.'' The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an ``inference dual.'' Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different from other generalized duals that have been proposed. The approach is illustrated by working out the details for propositional satisfiability and 0-1 programming problems. Computational tests are carried out for the latter, but the most promising contribution of logic-based Benders may be to provide a framework for combining optimization and constraint programming methods.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-003-0375-9