1 citations · 1 across the 2 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2022★ 1 cited
Proximity and flatness bounds for linear integer optimization
Marcel Celaya, Stefan Kuhlmann, Joseph Paat +1
We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex…
math.OC2021
Improving the Cook et al. Proximity Bound Given Integral Valued Constraints
Marcel Celaya, Stefan Kuhlmann, Joseph Paat +1
Consider a linear program of the form , where is an integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an op…
math.OC2020
Distance-sparsity transference for vertices of corner polyhedra
Iskander Aliev, Marcel Celaya, Martin Henk +1
We obtain a transference bound for vertices of corner polyhedra that connects two well-established areas of research: proximity and sparsity of solutions to integer programs. In th…