Bounding Linear Programs by Constraint Propagation: Application to Max-SAT. - Tomás Dlask; Tomás Werner (CP, 2020)

On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs. - Tomás Dlask; Tomás Werner (CP, 2020)

Relative Interior Rule in Block-Coordinate Descent. - Tomás Werner; Daniel Prusa; Tomás Dlask (CVPR, 2020)

On Coordinate-Wise Minimization Applied to General Convex Optimization Problems. - Tomás Dlask (KES, 2020)

A Class of Linear Programs Solvable by Coordinate-Wise Minimization. - Tomás Dlask; Tomás Werner (LION, 2020)

Unit Propagation by Means of Coordinate-Wise Minimization. - Tomás Dlask (LOD (1), 2020)

Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations. - Tomás Dlask; Tomás Werner; Simon de Givry (CP, 2021)

Classes of linear programs solvable by coordinate-wise minimization. - Tomás Dlask; Tomás Werner (Ann. Math. Artif. Intell., 2022)

Block-coordinate descent and local consistencies in linear programming. - Tomás Dlask (Constraints An Int. J., 2023)

Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs. - Tomás Dlask; Tomás Werner (Constraints An Int. J., 2023)

Super-reparametrizations of weighted CSPs: properties and optimization perspective. - Tomás Dlask; Tomás Werner; Simon de Givry (Constraints An Int. J., 2023)

Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem. - Tomás Dlask; Bogdan Savchynskyy (CoRR, 2023)

Using Constraint Propagation to Bound Linear Programs. - Tomás Dlask; Tomás Werner (J. Artif. Intell. Res., 2024)

Projection methods for finding the greatest element of the intersection of max-closed convex sets. - Tomás Dlask (Ann. Oper. Res., 2024)