Truncated Gröbner bases for integer programming
From MaRDI portal
Publication:1361003
Recommendations
Cited in
(13)- An integer programming algorithm based on Groebner basis of signature
- scientific article; zbMATH DE number 1276818 (Why is no real title available?)
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
- A comparison of algorithms for one class of totally regular truncations
- Partial Gröbner bases for multiobjective integer linear optimization
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- The combinatorics of modeling and analyzing biological systems
- Minimised geometric Buchberger algorithm for integer programming
- scientific article; zbMATH DE number 1736031 (Why is no real title available?)
- scientific article; zbMATH DE number 177867 (Why is no real title available?)
- Test sets of integer programs
- GRIN: an implementation of Gröbner bases for integer programming
- Non-standard approaches to integer programming
This page was built for publication: Truncated Gröbner bases for integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361003)