Fourier-Motzkin elimination extension to integer programming problems
From MaRDI portal
(Redirected from Publication:1226035)
Cites work
- An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach
- An application of mathematical logic to the integer linear programming problem
- An Enumeration Algorithm for Knapsack Problems
- Fourier-Motzkin elimination and its dual
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
Cited in
(16)- Logic applied to integer programming and integer programming applied to logic
- Generalized intersection patterns and two-symbol balanced arrays
- A characterisation of all feasible solutions to an integer program
- Decomposing finitely generated integral monoids by elimination
- Integer programming as projection
- Vector-valued Markov decision processes and the systems of linear inequalities
- Improved algorithms for optimal length resolution refutation in difference constraint systems
- Mixed logical-linear programming
- New tractable classes for default reasoning from conditional knowledge bases
- Fault diagnosis in labelled Petri nets: a Fourier-Motzkin based approach
- 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
- Projecting systems of linear inequalities with binary variables
- Clausal proofs for pseudo-Boolean reasoning
- Quantifier elimination over the integers
- Optimal length resolution refutations of difference constraint systems
This page was built for publication: Fourier-Motzkin elimination extension to integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1226035)
