Optimizing low dimensional functions over the integers

DOI10.1007/978-3-031-32726-1_9arXiv2303.02474MaRDI QIDQ6085994

Lars Rohwedder, José Verschae, Daniel Dadush, Arthur Léonard

Publication date: 9 November 2023

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

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

zbMATH Keywords

box-constrained integer programs, convex objectives of low domain dimension. proximity results

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Cites Work

• About the complexity of two-stage stochastic IPs
• How to Pack Your Items When You Have to Buy Your Knapsack
• Integer Programming with a Fixed Number of Variables
• Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
• Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints
• On Integer Programming and Convolution.
• Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube

This page was built for publication: Optimizing low dimensional functions over the integers