Exploring the geometric buchberger algorithm in integer programming
From MaRDI portal
Cites work
- A Geometric Buchberger Algorithm for Integer Programming
- A new efficient algorithm for computing Gröbner bases (F₄)
- A survey on signature-based algorithms for computing Gröbner bases
- A Variant of the Buchberger Algorithm for Integer Programming
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- An improved test set approach to nonlinear integer problems with applications to engineering design
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
- Gomory integer programs
- GRIN: an implementation of Gröbner bases for integer programming
- Gröbner bases of toric varieties
- How tight is the corner relaxation?
- scientific article; zbMATH DE number 177867 (Why is no real title available?)
- scientific article; zbMATH DE number 1254003 (Why is no real title available?)
- scientific article; zbMATH DE number 1254301 (Why is no real title available?)
- scientific article; zbMATH DE number 1302176 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Integral decomposition of polyhedra and some applications in mixed integer programming
- Partial Gröbner bases for multiobjective integer linear optimization
- Practical Gröbner basis computation
- Primal integer programming
- Solving MIPs via scaling-based augmentation
- Standard pairs and group relaxations in integer programming
- The associated primes of initial ideals of lattice ideals
- The Complexity of Generic Primal Algorithms for Solving General Integer Programs
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The structure of group relaxations
- Truncated Gröbner bases for integer programming
- Variation of cost functions in integer programming
- Zero-suppressed BDDs and their applications
This page was built for publication: Exploring the geometric buchberger algorithm in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033525)
