A new approach to partial constraint satisfaction problems

DOI10.1080/00207160412331296724zbMATH Open1160.90582OpenAlexW2040975306MaRDI QIDQ4652852

Author name not available (Why is that?)

Publication date: 28 February 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160412331296724

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Branch-and-Bound Methods: A Survey

Related Items (6)

Generalized partial computation using disunification to solve constraints ⋮ Recent Advances in Constraints ⋮ Title not available (Why is that?) ⋮ Automata, Languages and Programming ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ Piecewise linear valued constraint satisfaction problems with fixed number of variables

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On approximate constraint satisfaction 👍 👎
• The partial constraint satisfaction problem: Facets and lifting theorems 👍 👎
• A new tractable class of constraint satisfaction problems 👍 👎
• Automata, Languages and Programming 👍 👎
• Recent Advances in Constraints 👍 👎
• Artificial Intelligence: Methodology, Systems, and Applications 👍 👎

This page was built for publication: A new approach to partial constraint satisfaction problems

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