Skip to main content
Journal Article

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3064 244-255
DOI: 10.1007/978-3-540-25960-2_19
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents three kinds of algebraic-analytic algorithms for solving integer and mixed integer programming problems. We report both theoretical and experimental results. We use the generating function techniques introduced by A. Barvinok. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

De Loera, J. A., Haws, D., Hemmecke, R., Huggins, P., & Yoshida, R. (2004). Three kinds of integer programming algorithms based on Barvinok’s rational functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3064, 244–255. https://doi.org/10.1007/978-3-540-25960-2_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free