Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs

DOI10.1007/11493853_20zbMath1133.90405OpenAlexW4300005617MaRDI QIDQ5450937

Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih

Publication date: 17 March 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11493853_20

zbMATH Keywords

Lagrangean RelaxationSubgradient AlgorithmArc-Consistency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

Constraint programming and operations research ⋮ Lagrangian bounds from decision diagrams ⋮ Cost Propagation – Numerical Propagation for Optimization Problems

This page was built for publication: Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs