The b-hull of an integer program
(1981) Discrete Applied Mathematics — Vol. 3, n° 3, p. 193-201 (1981)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- Given a linear integer program: max{/b cx/: /b Ax/=/b b/, /b x/>or=0 and integer}, /b A/ rational, it is known that it can be solved in theory for all values of /b c/, either by testing a finite number of solutions for optimality, or by adding a finite number of valid inequalities, each generated from a superadditive function, and solving the resulting linear program. The main result is to show that (analogously) the integer program can be solved for all values of /b b /, either by testing a finite number of solutions for feasibility and optimality, or by adding a finite number of valid inequalities, each generated from a superadditive function and solving the resulting linear program.
- Affiliations
Citations
Wolsey, L. (1981). The b-hull of an integer program. Discrete Applied Mathematics, 3(3), 193-201. https://doi.org/10.1016/0166-218X(81)90016-0 (Original work published 1981)