Discrete Optimization by Relational Constraint Satisfaction

DOI10.1109/TPAMI.1982.4767300zbMATH Open0497.49027WikidataQ52720737 ScholiaQ52720737MaRDI QIDQ3962068FDOQ3962068

Authors: Julian R. Ullmann 

Publication date: 1982

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

zbMATH Keywords

constraint satisfactionpattern matchingconsistent labelingdiscrete relaxation

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Enumeration in graph theory (05C30) Dynamic programming in optimal control and differential games (49L20) Numerical methods of relaxation type (49M20)

Cited In (1)

• Partition search for non-binary constraint satisfaction

This page was built for publication: Discrete Optimization by Relational Constraint Satisfaction

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