Search Results for author: Tomáš Dlask

Found 3 papers, 0 papers with code

Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem

no code implementations26 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.

Super-Reparametrizations of Weighted CSPs: Properties and Optimization Perspective

no code implementations6 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.

A Class of Linear Programs Solvable by Coordinate-Wise Minimization

no code implementations28 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.

Combinatorial Optimization

Cannot find the paper you are looking for? You can Submit a new open access paper.