✦ LIBER ✦
An algorithm to perform a complete right-hand-side parametrical analysis for a 0–1-integer linear programming problem
✍ Scribed by Alejandro Crema
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 143 KB
- Volume
- 114
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
✦ Synopsis
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 choosing an appropiate ®nite sequence of nonparametric 0±1-Mixed Integer Linear Programming (MILP) problems in order to obtain a complete parametrical analysis. The algorithm may be implemented by using any software capable of solving MILP problems.