A tabu search approach to the constraint satisfaction problem as a general problem solver
- 16 April 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 106 (2-3) , 599-623
- https://doi.org/10.1016/s0377-2217(97)00294-4
Abstract
No abstract availableFunding Information
- Japan Society for the Promotion of Science
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 20 references indexed in Scilit:
- A tabu search algorithm for computing an operational timetableEuropean Journal of Operational Research, 1994
- The Reactive Tabu SearchINFORMS Journal on Computing, 1994
- A set partitioning heuristic for the generalized assignment problemEuropean Journal of Operational Research, 1994
- A survey of algorithms for the generalized assignment problemEuropean Journal of Operational Research, 1992
- A GRASP™ for a difficult single machine scheduling problemComputers & Operations Research, 1991
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- An algorithm for set covering problemEuropean Journal of Operational Research, 1987
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- A note on some computationally difficult set covering problemsMathematical Programming, 1980
- Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systemsPublished by Springer Nature ,1974