A new algebraic geometry algorithm for integer programming
From MaRDI portal
Recommendations
Cited in
(12)- The integral basis method for integer programming
- Minimised geometric Buchberger algorithm for integer programming
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming
- New product introduction against a predator: a bilevel mixed-integer programming approach
- scientific article; zbMATH DE number 1254003 (Why is no real title available?)
- scientific article; zbMATH DE number 1104299 (Why is no real title available?)
- A heuristic algorithm for solving integer linear programming problem and unveiling the applications
- An algebraic approach to integer portfolio problems
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization
- Some algebraic methods for solving multiobjective polynomial integer programs
- Computing local minimizers in polynomial optimization under genericity conditions
This page was built for publication: A new algebraic geometry algorithm for integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116774)