2 citations · 3 across the 2 of their papers we have counts for
3 papers
math.OC2023★ 1 cited
Relative-Interior Solution for the (Incomplete) Linear Assignment Problem with Applications to the Quadratic Assignment Problem
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 relati…
math.OC2022★ 2 cited
Super-Reparametrizations of Weighted CSPs: Properties and Optimization Perspective
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 appr…
math.OC2020
A Class of Linear Programs Solvable by Coordinate-Wise Minimization
Tomáš Dlask, Tomáš Werner
Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable) convex problems it may not find global minima.…