Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem Read chapter Read first chapter

2004 | OriginalPaper | Chapter

Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions

Authors : J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins, R. Yoshida

Published in: Integer Programming and Combinatorial Optimization

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

previous chapter Separable Concave Optimization Approximately Equals Piecewise Linear Optimization
next chapter The Path-Packing Structure of Graphs
Metadata
Title
Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions
Authors
J. A. De Loera
D. Haws
R. Hemmecke
P. Huggins
R. Yoshida
Copyright Year
2004
Publisher
Springer Berlin Heidelberg
Book
Integer Programming and Combinatorial Optimization

Print ISBN: 978-3-540-22113-5

Electronic ISBN: 978-3-540-25960-2

Copyright Year: 2004

DOI
https://doi.org/10.1007/978-3-540-25960-2_19