Lagrangian decomposition via sub-problem search

DOI10.1007/978-3-319-33954-2_6MaRDI QIDQ2815096zbMATH OpenOpenAlexFDO

Authors Geoffrey Chu, Graeme Gange, Peter J. Stuckey

Publication date 27 June 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-33954-2_6

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean programming (90C09) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• scientific article; zbMATH DE number 3976783
• Lagrangean decomposition for integer programming : theory and applications
• scientific article; zbMATH DE number 4053350
• Lagrangian bounds from decision diagrams

Cited in

(3)

• Constraint programming and operations research
• Compiling CP subproblems to MDDs and d-DNNFs
• Lagrangean decomposition: A model yielding stronger lagrangean bounds

This page was built for publication: Lagrangian decomposition via sub-problem search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815096)