A new algebraic geometry algorithm for integer programming

DOI10.1287/MNSC.46.7.999.12033MaRDI QIDQ3116774zbMATH OpenOpenAlexWikidataFDO

Authors Georgia Perakis, Dimitris Bertsimas, Sridhar R. Tayur

Publication date 12 February 2012

Published in Management Science (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.7897

zbMATH Keywords

integer programmingalgebraic geometryGroebner basis

Mathematics Subject Classification ID

Integer programming (90C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Recommendations

• scientific article; zbMATH DE number 1254003
• Minimised geometric Buchberger algorithm for integer programming
• scientific article; zbMATH DE number 1315278
• The integral basis method for integer programming
• Integer Programming and Combinatorial Optimization

Cited in

(9)

• A heuristic algorithm for solving integer linear programming problem and unveiling the applications
• Minimised geometric Buchberger algorithm for integer programming
• The integral basis method for integer programming
• A Polyhedral Frobenius Theorem with Applications to Integer Optimization
• Some algebraic methods for solving multiobjective polynomial integer programs
• An algebraic approach to integer portfolio problems
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
• New product introduction against a predator: a bilevel mixed-integer programming approach
• Applying Gröbner basis method to multiparametric polynomial nonlinear programming

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)