Fourier-Motzkin elimination extension to integer programming problems

DOI10.1016/0097-3165(76)90055-8zbMath0326.90047OpenAlexW2098876019MaRDI QIDQ1226035

H. Paul Williams

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(76)90055-8

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (14)

Vector-valued Markov decision processes and the systems of linear inequalities ⋮ Optimal length resolution refutations of difference constraint systems ⋮ Fault diagnosis in labelled Petri nets: a Fourier-Motzkin based approach ⋮ Logic applied to integer programming and integer programming applied to logic ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications ⋮ Improved algorithms for optimal length resolution refutation in difference constraint systems ⋮ Generalized intersection patterns and two-symbol balanced arrays ⋮ Projecting systems of linear inequalities with binary variables ⋮ Mixed logical-linear programming ⋮ A characterisation of all feasible solutions to an integer program ⋮ Decomposing finitely generated integral monoids by elimination ⋮ Integer programming as projection ⋮ New tractable classes for default reasoning from conditional knowledge bases

Cites Work

• Unnamed Item
• An application of mathematical logic to the integer linear programming problem
• Fourier-Motzkin elimination and its dual
• An Enumeration Algorithm for Knapsack Problems
• An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach

This page was built for publication: Fourier-Motzkin elimination extension to integer programming problems