Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem

DOI10.1007/978-3-319-07557-0_4zbMath1418.90157OpenAlexW1859614188MaRDI QIDQ5418983

Jesús A. De Loera, Quentin Louveaux, Iskander M. Aliev

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://orbi.ulg.ac.be/handle/2268/166141

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Quantitative Tverberg theorems over lattices and other discrete sets ⋮ Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem ⋮ A quantitative Doignon-Bell-Scarf theorem ⋮ A new view of relationship between atomic posets and complete (algebraic) lattices

This page was built for publication: Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem