Parametric Integer Programming in Fixed Dimension
From MaRDI portal
Publication:3168997
DOI10.1287/moor.1080.0320zbMath1218.90123arXiv0801.4336OpenAlexW2119962358MaRDI QIDQ3168997
Friedrich Eisenbrand, Gennady Shmonin
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.4336
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
On polynomial kernels for sparse integer linear programs, Parameterized Resiliency Problems via Integer Linear Programming, The Integrality Number of an Integer Program, An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions, Short Presburger Arithmetic Is Hard, On lattice point counting in \(\varDelta\)-modular polyhedra, Testing additive integrality gaps, LLL-reduction for integer knapsacks, Integer programming in parameterized complexity: five miniatures, Designing optimization problems with diverse solutions, Distances to lattice points in knapsack polyhedra, Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs, Alternatives for testing total dual integrality, The Distributions of Functions Related to Parametric Integer Optimization, On the number of integer points in translated and expanded polyhedra, A randomized sieving algorithm for approximate integer programming, Enumerating Projections of Integer Points in Unbounded Polyhedra, Integer Programming in Parameterized Complexity: Three Miniatures., Parametric integer programming algorithm for bilevel mixed integer programs, Normal toric ideals of low codimension, Parameterized resiliency problems
