| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142030 | Operations Research Letters | 2016 | 5 Pages |
Abstract
The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by A∈Zm×nA∈Zm×n and find an algorithm to solve such problems in polynomial-time provided that both the largest absolute value of an entry in AA and mm are constant.Then, this is applied to solve integer programs in inequality form in polynomial-time, where the absolute values of all maximal sub-determinants of AA lie between 11 and a constant.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
S. Artmann, F. Eisenbrand, C. Glanzer, T. Oertel, S. Vempala, R. Weismantel,