n-Fold integer programming in cubic time

n -Fold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variable-dimension, parametrization of all of integer programming. The fastest algorithm for n -fold integer programming pr...

Full description

Saved in:
Bibliographic Details
Published inMathematical programming Vol. 137; no. 1-2; pp. 325 - 341
Main Authors Hemmecke, Raymond, Onn, Shmuel, Romanchuk, Lyubov
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer-Verlag 01.02.2013
Springer Nature B.V
Subjects
Algorithms
Analysis
Approximation
Calculus of Variations and Optimal Control; Optimization
Combinatorics
Full Length Paper
Hierarchies
Integer programming
Mathematical and Computational Physics
Mathematical Methods in Physics
Mathematical programming
Mathematics
Mathematics and Statistics
Mathematics of Computing
Numerical Analysis
Operations research
Parametrization
Statistics
Studies
Theoretical
68R
52B
52C
90B
62H
90C
68Q
Online AccessGet full text
ISSN0025-5610
1436-4646
DOI10.1007/s10107-011-0490-y

Cover