On Burdet and Johnson's Algorithm for Integer Programming
Babak Moazzez, Kevin Cheung
TL;DR
This paper critically examines Burdet and Johnson's 1977 algorithm for integer programming, identifying its shortcomings, providing counterexamples, and proposing solutions to improve its reliability.
Contribution
It highlights the deficiencies of the original algorithm, offers concrete examples of failure, and suggests modifications to enhance its effectiveness.
Findings
The original algorithm fails on certain problem instances.
Proposed fixes improve the algorithm's success rate.
The analysis clarifies the algorithm's limitations and potential improvements.
Abstract
In this paper, some deficiencies of a method proposed by Burdet and Johnson in 1977 for solving integer programming problems are discussed. Examples where the algorithm fails to solve the IP and ways to fix these errors are given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Advanced Graph Theory Research · Complexity and Algorithms in Graphs