3 citations · 7 across the 13 of their papers we have counts for
4 papers · 1 filter
On the geometry of symmetry breaking inequalities
José Verschae, Matías Villagra, Léonard von Niederhäusern
Breaking symmetries is a popular way of speeding up the branch-and-bound method for symmetric integer programs. We study fundamental domains, which are minimal and closed symmetry…
Maintaining Perfect Matchings at Low Cost
Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae
The min-cost matching problem suffers from being very sensitive to small changes of the input. Even in a simple setting, e.g., when the costs come from the metric on the line, addi…
The Primal-Dual Greedy Algorithm for Weighted Covering Problems
Britta Peis, José Verschae, Andreas Wierz
We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solutio…
On the Configuration-LP for Scheduling on Unrelated Machines
José Verschae, Andreas Wiese
One of the most important open problems in machine scheduling is the problem of scheduling a set of jobs on unrelated machines to minimize the makespan. The best known approximatio…