1 citations · 3 across the 10 of their papers we have counts for
11 papers
Polynomial Matrices in Integer Programming With Restricted Subdeterminants
Marcel Celaya, Stefan Kuhlmann, Robert Weismantel
We introduce a framework for tackling questions in discrete optimization associated with parametric constraint matrices. More precisely, the constraint matrices have entries that a…
Sparsity and integrality gap transference bounds for integer programs
Iskander Aliev, Marcel Celaya, Martin Henk
We obtain new transference bounds that connect two active areas of research: proximity and sparsity of solutions to integer programs. Specifically, we study the additive integralit…
On Matrices over a Polynomial Ring with Restricted Subdeterminants
Marcel Celaya, Stefan Kuhlmann, Robert Weismantel
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the rin…
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…
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…
Patchworking Oriented Matroids
Marcel Celaya, Georg Loho, Chi Ho Yuen
In a previous work, we gave a construction of (not necessarily realizable) oriented matroids from a triangulation of a product of two simplices. In this follow-up paper, we use a v…