2 citations · 2 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020
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…
cs.DM2018
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…