Constraint relaxation may be perfect (Q2384384)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Constraint relaxation may be perfect	scientific article

Statements

scholarly article

0 references

Constraint relaxation may be perfect (English)

0 references

zbMATH Open document ID

0 references

10.1016/0004-3702(91)90059-S

0 references

0 references

Francesca Rossi

0 references

Artificial Intelligence

0 references

publication date

20 September 2007

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

Graph expressions and graph rewritings

0 references

Nonserial dynamic programming

0 references

Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978

0 references

Network-based heuristics for constraint-satisfaction problems

0 references

Synthesizing constraint expressions

0 references

A Sufficient Condition for Backtrack-Free Search

0 references

0 references

Consistency in networks of relations

0 references

Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice

0 references

Networks of constraints: Fundamental properties and applications to picture processing

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2384384

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2384384&oldid=35007921"