论文信息 - Fourier-Motzkin Elimination Extension to Integer Programming Problems

Fourier-Motzkin Elimination Extension to Integer Programming Problems

This paper describes how the Fourier-Motzkin Elimination Method, which can be used for solving Linear Programming Problems, can be extended to deal with Integer Programming Problems. The extension derives from a known decision procedure for the formal theory of a fragment of arithmetic which excludes multiplication.

H. Paul Williams | H. P. Williams | H.P Williams

[1] D. Kohler. PROJECTIONS OF CONVEX POLYHEDRAL SETS , 1967 .

[2] C. H. Langford. Some Theorems on Deducibility , 1926 .

[3] R. D. Lee. An application of mathematical logic to the integer linear programming problem , 1972, Notre Dame J. Formal Log..

[4] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[5] C. H. Langford. Theorems on Deducibility , 1926 .

[6] A. Victor Cabot,et al. An Enumeration Algorithm for Knapsack Problems , 1970, Oper. Res..

[7] Gordon H. Bradley,et al. An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach , 1973, Oper. Res..

[8] George B. Dantzig,et al. Fourier-Motzkin Elimination and Its Dual , 1973, J. Comb. Theory, Ser. A.