Lower bounds for non-binary constraint optimization problems

DOI10.1007/3-540-45578-7_22MaRDI QIDQ4475641zbMATH OpenFDO

Authors Javier Larrosa, Marti Sanchez, P. Meseguer

Publication date 9 August 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/2239/22390317.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Decomposable constraints
• On forward checking for non-binary constraint satisfaction
• Binary vs. non-binary constraints
• Methods and Applications of Artificial Intelligence
• scientific article; zbMATH DE number 2243409

Cited in

(7)

• Bucket elimination for multiobjective optimization problems
• Optimization of the temple lower bound
• Computing lower bound for MAX-CSP problems
• New lower bounds of constraint violations for over-constrained problems
• A general scheme for multiple lower bound computation in constraint optimization
• On forward checking for non-binary constraint satisfaction
• Combining VNS with constraint programming for solving anytime optimization problems

This page was built for publication: Lower bounds for non-binary constraint optimization problems

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