Computing lower bound for MAX-CSP problems

DOI10.1007/3-540-45034-3_62MaRDI QIDQ4450925zbMATH OpenFDO

Authors Hachemi Bannaceur, Aomar Osmani

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2718/27180614.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Partition-based lower bound for Max-CSP
• A general scheme for multiple lower bound computation in constraint optimization
• Lower bounds for non-binary constraint optimization problems
• A branch and bound algorithm for numerical Max-CSP
• New lower bounds of constraint violations for over-constrained problems

Cited in

(3)

• Partition-based lower bound for Max-CSP
• Principles and Practice of Constraint Programming – CP 2004
• A branch and bound algorithm for numerical Max-CSP

This page was built for publication: Computing lower bound for MAX-CSP problems

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