Bibliography

Clements, Crawford, Joslin, Nemhauser, Puttlitz, SavelsberghClements et al.1997

Clements, D., Crawford, J., Joslin, D., Nemhauser, G., Puttlitz, M., Savelsbergh, M. 1997.
Heuristic optimization: A hybrid AI/OR approach
In Proceedings of the Workshop on Industrial Constraint-Directed Scheduling.
In conjunction with the Third International Conference on Principles and Practice of Constraint Programming (CP97).

Crawford, Dalal, WalserCrawford et al.1998

Crawford, J., Dalal, M., Walser, J. 1998.
Abstract local search
In Proceedings of the AIPS-98 Workshop on Planning as Combinatorial Search.
In conjunction with the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS-98).

CrawfordCrawford1996

Crawford, J. M. 1996.
An approach to resource constrained project scheduling
In Proceedings of the 1996 Artificial Intelligence and Manufacturing Research Planning Workshop, 35-39.

Culberson LuoCulberson Luo1993

Culberson, J. C. Luo, F. 1993.
Exploring the k-colorable landscape with iterated greedy
In [Johnson TrickJohnson Trick1996], 245-284.

Feo ResendeFeo Resende1995

Feo, T. A. Resende, M. G. 1995.
Greedy randomized adaptive search procedures
Journal of Global Optimization, 6, 109-133.

Garey JohnsonGarey Johnson1979

Garey, M. R. Johnson, D. S. 1979.
Computers and Intractability: A Guide to the Theory of NP-Completeness.
W. H. Freeman.

Glover LagunaGlover Laguna1997

Glover, F. Laguna, M. 1997.
Tabu Search.
Kluwer.

Glover, Parker, RyanGlover et al.1993

Glover, F., Parker, M., Ryan, J. 1993.
Coloring by tabu branch and bound
In [Johnson TrickJohnson Trick1996], 285-307.

Gomes, Selman, KautzGomes et al.1998

Gomes, C., Selman, B., Kautz, H. 1998.
Boosting combinatorial search through randomization
In Proceedings of AAAI-98, 431-437.

Johnson TrickJohnson Trick1996

Johnson, D. S. Trick, M. A.. 1996.
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1996, 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society.

Joslin ClementsJoslin Clements1998

Joslin, D. Clements, D. 1998.
``Squeaky wheel'' optimization
In Proceedings of AAAI-98, 340-346.

Lewandowski CondonLewandowski Condon1993

Lewandowski, G. Condon, A. 1993.
Experiments with parallel graph coloring heuristics and applications of graph coloring
In [Johnson TrickJohnson Trick1996], 309-334.

MorgensternMorgenstern1993

Morgenstern, C. 1993.
Distributed coloration neighborhood search
In [Johnson TrickJohnson Trick1996], 335-357.

Parkes WalserParkes Walser1996

Parkes, A. Walser, J. 1996.
Tuning local search for satisfiability testing
In Proceedings of AAAI-96, 356-362.

Pinson, Prins, RullierPinson et al.1994

Pinson, E., Prins, C., Rullier, F. 1994.
Using tabu search for solving the resource-constrained project scheduling problem
In EURO-WG PMS 4 (EURO Working Group on Project Management and Scheduling), 102-106 Louvain, Belgium.

Selman, Kautz, CohenSelman et al.1993

Selman, B., Kautz, H. A., Cohen, B. 1993.
Local search strategies for satisfiability testing
In [Johnson TrickJohnson Trick1996], 521-531.

SyswerdaSyswerda1994

Syswerda, G. P. 1994.
Generation of schedules using a genetic procedure.
U.S. Patent number 5,319,781.