Integrating pivot based search with branch and bound for binary MIPs

MaRDI QIDQ2731680zbMATH OpenFDO

Authors Arne Løkketangen, David L. Woodruff

Publication date 29 July 2001

Published in Control and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundchunkingglobal diversification testspivot-based tabu search

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tabu search within a pivot and complement framework
• Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
• scientific article; zbMATH DE number 1488101
• Pivot and shift -- a mixed integer programming heuristic
• scientific article; zbMATH DE number 2209656

Cited in

(3)

• Exploring relaxation induced neighborhoods to improve MIP solutions
• scientific article; zbMATH DE number 1488077 (Why is no real title available?)
• Tabu search within a pivot and complement framework

This page was built for publication: Integrating pivot based search with branch and bound for binary MIPs

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