Approximated consistency for the automatic recording problem

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

References Powered by Scopus

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

699Citations
N/AReaders
Get full text

A Sufficient Condition for Backtrack-Free Search

472Citations
N/AReaders
Get full text

Cost-based domain filtering

102Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Generalizing alldifferent: The somedifferent constraint

14Citations
N/AReaders
Get full text

Approximated consistency for the automatic recording constraint

3Citations
N/AReaders
Get full text

Upper bounds on the number of solutions of binary integer programs

1Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Sellmann, M. (2005). Approximated consistency for the automatic recording problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 822–826). https://doi.org/10.1007/11564751_72

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 1

100%

Readers' Discipline

Tooltip

Computer Science 1

100%

Save time finding and organizing research with Mendeley

Sign up for free