Fourier-Motzkin elimination and its dual
From MaRDI portal
Publication:2559426
DOI10.1016/0097-3165(73)90004-6zbMath0258.15010OpenAlexW4210721069MaRDI QIDQ2559426
B. Curtis Eaves, George B. Dantzig
Publication date: 1973
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(73)90004-6
Related Items
A singular loop transformation framework based on non-singular matrices, A layered algorithm for quantifier elimination from linear modular constraints, Verification of Hybrid Systems, Optimal length resolution refutations of difference constraint systems, An exact algorithm for the static rebalancing problem arising in bicycle sharing systems, A linear programming primer: from Fourier to Karmarkar, Fourier algorithm revisited, Equality detection for linear arithmetic constraints, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Wald, QLR, and score tests when parameters are subject to linear inequality constraints, Determining the interset distance, Integer feasibility and refutations in UTVPI constraints using bit-scaling, Modular discrete time approximations of distributed hybrid automata, Optimal move blocking strategies for model predictive control, Geometric conditions for the existence or non-existence of a solution to the perspective 3-point problem, A faster algorithm for determining the linear feasibility of systems of BTVPI constraints, Waiting Nets: State Classes and Taxonomy, A global optimisation approach to range-restricted survey calibration, A certifying algorithm for lattice point feasibility in a system of UTVPI constraints, An instantiation scheme for satisfiability modulo theories, Integer set reduction for stochastic mixed-integer programming, A calculation approach to scalarization for polyhedral sets by means of set relations, Consistency conditions for the influence graphs generalized finite difference method, Equilibrium behavior in markets and games: Testable restrictions and identification., A characterisation of all feasible solutions to an integer program, Interpolants for Linear Arithmetic in SMT, Zero polyhedral cones, A note on splitting of variables in integer programming models, Unnamed Item, Quantifier elimination for a class of exponential polynomial formulas, Mathematical and simulation-based analysis of the behavior of admixed taxa in the neighbor-joining algorithm, On a decision procedure for quantified linear programs, Quantifier-free interpolation in combinations of equality interpolating theories, On Fourier's algorithm for linear arithmetic constraints, A study of general and security Stackelberg game formulations, Box invariance in biologically-inspired dynamical systems, Fourier-Motzkin elimination extension to integer programming problems, On integer closure in a system of unit two variable per inequality constraints, Reasoning about synchronization in GALS systems, A unified approach for finding real and integer solutions to systems of linear inequalities, Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches, A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints, Combinatorial optimization and small polytopes, The splitting of variables and constraints in the formulation of integer programming models, Feasibility checking in Horn constraint systems through a reduction based approach, Entropic perturbation method for solving a system of linear inequalities
Cites Work
