Approximations and randomization to boost CSP techniques

DOI10.1023/B:ANOR.0000032572.32788.DAMaRDI QIDQ1876531zbMATH OpenOpenAlexFDO

Authors Carla P. Gomes, David B. Shmoys

Publication date 20 August 2004

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:anor.0000032572.32788.da

zbMATH Keywords

linear programmingcombinatorial problemsconstraint satisfaction problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1002207
• Principles and Practice of Constraint Programming – CP 2004
• Randomized approximation of the constraint satisfaction problem
• scientific article; zbMATH DE number 1234562
• Enhancing the performance of constraint programming through the introduction of linear programming

Cited in

(6)

• From Mean and Median Income to the Most Adequate Way of Taking Inequality into Account
• Principles and Practice of Constraint Programming – CP 2004
• Efficient algorithms for heavy-tail analysis under interval uncertainty
• Approximation Algorithms for CSPs
• Automata, Languages and Programming
• Which robust versions of sample variance and sample covariance are most appropriate for econometrics: symmetry-based analysis

Describes a project that uses

Uses Software

• Chaff

This page was built for publication: Approximations and randomization to boost CSP techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876531)