A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem

An algorithm to perform a complete right

An algorithm to perform a complete right-hand-side parametrical analysis for a 0–1-integer linear programming problem

✍ Alejandro Crema 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We designed and implemented an algorithm to solve the continuous right-hand side parametric 0±1-Integer Linear Programming (ILP) problem, that is to solve a family of 0±1-ILP problems in which the problems are related by having identical objective and matrix coecients. Our algorithm works by choosin