no code implementations • 26 Jan 2023 • Tomáš Dlask, Bogdan Savchynskyy
We study the set of optimal solutions of the dual linear programming formulation of the linear assignment problem (LAP) to propose a method for computing a solution from the relative interior of this set.
no code implementations • 6 Jan 2022 • Tomáš Dlask, Tomáš Werner, Simon de Givry
The notion of reparametrizations of Weighted CSPs (WCSPs) (also known as equivalence-preserving transformations of WCSPs) is well-known and finds its use in many algorithms to approximate or bound the optimal WCSP value.
no code implementations • 28 Jan 2020 • Tomáš Dlask, Tomáš Werner
We show that dual LP relaxations of several well-known combinatorial optimization problems are in this class and the method finds a global minimum with sufficient accuracy in reasonable runtimes.