On the Congruency-Constrained Matroid Base
Consider a matroid where all elements are labeled with an element in Z. We are interested
in finding a base where the sum of the labels is congruent to g (mod m). We show that this …
in finding a base where the sum of the labels is congruent to g (mod m). We show that this …
On the Exact Matching Problem in Dense Graphs
In the Exact Matching problem, we are given a graph whose edges are colored red or blue
and the task is to decide for a given integer k, if there is a perfect matching with exactly k red …
and the task is to decide for a given integer k, if there is a perfect matching with exactly k red …
Integer programs with nearly totally unimodular matrices: the cographic case
It is a notorious open question whether integer programs (IPs), with an integer coefficient
matrix $ M $ whose subdeterminants are all bounded by a constant $\Delta $ in absolute …
matrix $ M $ whose subdeterminants are all bounded by a constant $\Delta $ in absolute …
On matrices over a polynomial ring with restricted subdeterminants
M Celaya, S Kuhlmann, R Weismantel - International Conference on …, 2024 - Springer
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 …
parametric in the following sense: their constraint matrices correspond to matrices over the …
Extended formulations for a class of polyhedra with bimodular cographic constraint matrices
We are motivated by integer linear programs (ILPs) defined by constraint matrices with
bounded determinants. Such matrices generalize the notion of totally-unimodular matrices …
bounded determinants. Such matrices generalize the notion of totally-unimodular matrices …
Total Matching and Subdeterminants
In the total matching problem, one is given a graph G with weights on the vertices and
edges. The goal is to find a maximum weight set of vertices and edges that is the non …
edges. The goal is to find a maximum weight set of vertices and edges that is the non …
Three perspectives on integer programming: practical and theoretical applications, and the case of bounded subdeterminants
SA Kober - 2023 - mediatum.ub.tum.de
The main body of the thesis consists of three chapters, each considering a different
viewpoint on integer programming. Firstly, we consider a practical perspective in form of a …
viewpoint on integer programming. Firstly, we consider a practical perspective in form of a …
Check for updates Total Matching and Subdeterminants
L Ferrarini¹, S Fiorini, S Kober, Y Yuditsky - … 8th International Symposium … - books.google.com
In the total matching problem, one is given a graph G with weights on the vertices and
edges. The goal is to find a maximum weight set of vertices and edges that is the non …
edges. The goal is to find a maximum weight set of vertices and edges that is the non …