Parametrizing an Integer Linear Program by an Integer

DOI10.1137/16M1102458zbMath1440.90029arXiv1510.01343OpenAlexW2963366878MaRDI QIDQ3130449

Bobby Shen

Publication date: 22 January 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingconvex hullquasi-polynomialparametric integer linear programming

Mathematics Subject Classification ID

Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Polynomial optimization (90C23)

Related Items (4)

Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity ⋮ A Plethora of Polynomials: A Toolbox for Counting Problems ⋮ A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems ⋮ Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior

Cites Work

• Unnamed Item
• Unnamed Item
• The unreasonable ubiquitousness of quasi-polynomials
• Integer hulls of linear polyhedra and scl in families
• Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
• Generalized Ehrhart polynomials
• Polynomials Associated with Finite Gell-Complexes

This page was built for publication: Parametrizing an Integer Linear Program by an Integer