Efficient intelligent backtracking using linear programming

DOI10.1287/IJOC.14.4.373.2823MaRDI QIDQ2884543zbMATH OpenOpenAlexFDO

Authors Bruce Davey, Natashia Boland, Peter J. Stuckey

Publication date 30 May 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.14.4.373.2823

zbMATH Keywords

integer programmingcutting planesbranch and bound

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Analysis of algorithms (68W40) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Intelligent backtracking in \(\text{CLP}(\Re)\)
• Backjump-based backtracking for constraint satisfaction problems
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
• Combining the scalability of local search with the pruning techniques of systematic search
• An intelligent algorithm for mixed-integer programming models

Cited in

(9)

• Computational aspects of infeasibility analysis in mixed integer programming
• PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking
• Forward checking and intelligent backtracking
• Experiments with conflict analysis in mixed integer programming
• Conflict Analysis for MINLP
• Conflict-Driven Heuristics for Mixed Integer Programming
• Note on the Hahn-Banach theorem in a partially ordered vector space
• Information-based branching schemes for binary linear mixed integer problems
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems

Describes a project that uses

Uses Software

• MINTO
• MIPLIB

This page was built for publication: Efficient intelligent backtracking using linear programming

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