A new contraction technique with applications to congruency-constrained cuts

DOI10.1007/978-3-030-17953-3_25zbMath1436.90127OpenAlexW3161558599MaRDI QIDQ5919391

Rico Zenklusen, Martin Nägele

Publication date: 6 February 2020

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/412160

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations

This page was built for publication: A new contraction technique with applications to congruency-constrained cuts