A characterisation of all feasible solutions to an integer program
- 31 January 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 5 (1) , 147-155
- https://doi.org/10.1016/0166-218x(83)90024-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A duality theorem for linear congruencesDiscrete Applied Mathematics, 1984
- Fourier-Motzkin elimination extension to integer programming problemsJournal of Combinatorial Theory, Series A, 1976
- On fourier’s analysis of linear inequality systemsPublished by Springer Nature ,1974
- Fourier-Motzkin elimination and its dualJournal of Combinatorial Theory, Series A, 1973
- An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration ApproachOperations Research, 1973
- An application of mathematical logic to the integer linear programming problem.Notre Dame Journal of Formal Logic, 1972
- An Enumeration Algorithm for Knapsack ProblemsOperations Research, 1970
- Solvability and Consistency for Linear Equations and InequalitiesThe American Mathematical Monthly, 1956