A Geometric Buchberger Algorithm for Integer Programming
From MaRDI portal
Recommendations
Cited in
(36)- Non-standard approaches to integer programming
- scientific article; zbMATH DE number 4133835 (Why is no real title available?)
- Minimised geometric Buchberger algorithm for integer programming
- The combinatorics of modeling and analyzing biological systems
- Test sets for vertex cover problems
- On the complexity of smooth projective toric varieties
- A study of a family of monomial ideals
- Test sets of integer programs
- Computing generating sets of lattice ideals and Markov bases of lattices
- On the positive sums property and the computation of Graver test sets
- A Variant of the Buchberger Algorithm for Integer Programming
- Bounds on degrees of projective schemes
- Exploring the geometric buchberger algorithm in integer programming
- An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
- On rotational symmetries of drawings of coherent periodic graphs
- Generating functions and duality for integer programs
- Binomial ideals
- Generalized reduction to compute toric ideals
- Algebraic algorithms for sampling from conditional distributions
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- scientific article; zbMATH DE number 2152474 (Why is no real title available?)
- The vertex ideal of a lattice.
- Standard pairs and group relaxations in integer programming
- Short rational generating functions for lattice point problems
- Computing Gröbner bases of pure binomial ideals via submodules of Z^n
- Augmentation search for integer programming over a polyhedron
- Computing local minimizers in polynomial optimization under genericity conditions
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Permutohedra and minimal matrices
- On computing Hilbert bases via the Elliot--MacMahon algorithm
- Test sets and inequalities for integer programs
- Learning a performance metric of Buchberger's algorithm
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- Implementation techniques for geometric branch-and-bound matching methods
- GRIN: an implementation of Gröbner bases for integer programming
This page was built for publication: A Geometric Buchberger Algorithm for Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881514)
