Extending GENET for non-binary CSP's
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 338-343
- https://doi.org/10.1109/tai.1995.479651
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- A Generic Neural Network Approach For Constraint Satisfaction ProblemsPublished by Springer Nature ,1992
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- Temporal constraint networksArtificial Intelligence, 1991
- Integer programming vs. expert systems: an experimental comparisonCommunications of the ACM, 1990
- Constraint satisfaction algorithms1Computational Intelligence, 1989
- Applications of CHIP to industrial and engineering problemsPublished by Association for Computing Machinery (ACM) ,1988
- Job-shop scheduling using automated reasoning: A case study of the car-sequencing problemJournal of Automated Reasoning, 1986
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Backtrack programming techniquesCommunications of the ACM, 1975