A Geometric Buchberger Algorithm for Integer Programming
From MaRDI portal
Publication:4881514
DOI10.1287/moor.20.4.864zbMath0846.90079OpenAlexW2038546526MaRDI QIDQ4881514
Publication date: 15 July 1996
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8953
Related Items
A study of a family of monomial ideals, Computing generating sets of lattice ideals and Markov bases of lattices, Bounds on degrees of projective schemes, On rotational symmetries of drawings of coherent periodic graphs, Generating functions and duality for integer programs, An algebraic geometry algorithm for scheduling in presence of setups and correlated demands, Unnamed Item, Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials, Binomial ideals, Learning a performance metric of Buchberger's algorithm, Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\), An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms, GENERALIZED REDUCTION TO COMPUTE TORIC IDEALS, Test sets and inequalities for integer programs, Non-standard approaches to integer programming, The combinatorics of modeling and analyzing biological systems, On computing Hilbert bases via the Elliot--MacMahon algorithm, Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach, Short rational generating functions for lattice point problems, An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets, Algebraic algorithms for sampling from conditional distributions, On the complexity of smooth projective toric varieties, Standard pairs and group relaxations in integer programming, Test sets of integer programs, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Permutohedra and minimal matrices, The vertex ideal of a lattice.
