Three kinds of integer programming algorithms based on Barvinok's rational functions

DOI10.1007/978-3-540-25960-2_19MaRDI QIDQ5712457zbMATH OpenOpenAlexFDO

Authors Jesús A. De Loera, David C. Haws, Raymond Hemmecke, Ruriko Yoshida, Peter Huggins

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b97946

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• A computational study of integer programming algorithms based on Barvinok's rational functions
• Integer programming, Barvinok's counting algorithm and Gomory relaxations.
• scientific article; zbMATH DE number 1315278
• Computing with an algebraic-perturbation variant of Barvinok's algorithm
• An algebraic-perturbation variant of Barvinok's algorithm

Cited in

(5)

• Integer programming, Barvinok's counting algorithm and Gomory relaxations.
• A computational study of integer programming algorithms based on Barvinok's rational functions
• A new algebraic geometry algorithm for integer programming
• Computing Optimized Path Integrals for Knapsack Feasibility
• Fast evaluation of generalized Todd polynomials: applications to MacMahon's partition analysis and integer programming

This page was built for publication: Three kinds of integer programming algorithms based on Barvinok's rational functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712457)