The Distributions of Functions Related to Parametric Integer Optimization

DOI10.1137/19M1275954zbMath1451.90101arXiv1907.07960WikidataQ114615461 ScholiaQ114615461MaRDI QIDQ5125408

Joseph Paat, Robert Weismantel, Timm Oertel

Publication date: 7 October 2020

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.07960

zbMATH Keywords

distancesparsityinteger optimization

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10)

Related Items

Improving the Cook et al. proximity bound given integral valued constraints, On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems, Proximity bounds for random integer programs, Proximity bounds for random integer programs, The integrality number of an integer program, Sparse representation of vectors in lattices and semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The width and integer optimization on simplices with bounded minors of the constraint matrices
• An integer analogue of Carathéodory's theorem
• The b-hull of an integer program
• The value function of a mixed integer program: I
• Lattice invariant valuations on rational polytopes
• The value function of a mixed integer program. II
• LLL-reduction for integer knapsacks
• Distances to lattice points in knapsack polyhedra
• Distances between optimal solutions of mixed-integer programs
• Sparsity of integer solutions in the average case
• Computing the integer programming gap
• On the (co)girth of a connected matroid
• Carathéodory bounds for integer cones
• On the limit distribution of Frobenius numbers
• Parametric Integer Programming in Fixed Dimension
• Deterministic Approximation Algorithms for the Nearest Codeword Problem
• Sensitivity theorems in integer linear programming
• Probabilistic Analysis of the Multidimensional Knapsack Problem
• On the complexity of integer programming
• Normality and covering properties of affine semigroups
• A counterexample to an integer analogue of Carathéodory's theorem
• Lectures on Polytopes
• The intractability of computing the minimum distance of a code
• The Support of Integer Optimal Solutions
• Elementary Methods in Number Theory
• The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
• Optimizing Sparsity over Lattices and Semigroups
• The Integrality Number of an Integer Program
• On Integer Programming and Convolution.
• On Proximity for k-Regular Mixed-Integer Linear Optimization
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• A Polyhedral Frobenius Theorem with Applications to Integer Optimization
• Sparse Solutions of Linear Diophantine Equations