INCOP: An open library for incomplete combinatorial optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 909-913

  Neveu, Bertrand ^a   Trombettoni, Gilles ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C++ (PROGRAMMING LANGUAGE); COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; GRAPH THEORY; SIMULATED ANNEALING; TABU SEARCH;

COMBINATORIAL PROBLEM; CONFIGURATION COSTS; FREQUENCY ASSIGNMENTS; GRAPH COLORINGS; LOCAL SEARCH METHOD; META HEURISTICS; METROPOLIS ALGORITHMS; NEIGHBORHOOD MANAGEMENT;

OPTIMIZATION;

EID: 35048851286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_77     Document Type: Article

References (14)

1. D. T. Connolly. An improved annealing scheme for the QAP. European Journal of Operational Research, (46):93-100, 1990.
2. L. DiGaspero and A. Schaerf. Easylocal++ : An object oriented framework for flexible design of local search algorithms. Technical Report UDMI/13, Universita degli Studie di Udine, 2000.
3. Tassos Dimitriou and Russell Impagliazzo. Towards an analysis of local optimiza tion algorithms. In Proc. STOC, 1996.
4. Philippe Galinier and Jin-Kao Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4):379-397, 1999.
5. F. Glover and M.Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
6. L. Michel and P. Van Hentenryck. Localizer++ : An open library for local search. Technical Report CS-01-02, Brown University, 2001.
7. S. Minton, M. Johnston, A. Philips, and P. Laird. Minimizing conflict: a heuris tic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205, 1992.
8. C. Morgenstern. Distributed coloration neighborhood search. In D. Johnson and M. Trick, editors, Cliques, Coloring, and Satisfiability, volume 26 of dimacs, pages 335-357. American Mathematical Society, 1996.
9. Bertrand Neveu and Gilles Trombettoni. When local search goes with the winners. In Proc. of CPAIOR'03 workshop, 2003.
10. P. K. Nielsen. SCOOP 2.0 Reference Manual. SINTEF Report 42A98001, 1998.
11. V. Phan and S. Skiena. Coloring graphs with a general heuristic search engine. In Computational Symposium of Graph Coloring and Generalizations, 2002.
12. S. Voß and D. Woodruff. Optimization Software Class Libraries. Kluwer, 2002.
13. S. Voß and D.L. Woodruff. Hotframe: A heuristic optimization framework. [12], pages 81-154.
14. C. Voudouris and R.Dorne. Integrating heuristic search and one-way constraints in the iOpt toolkit. [12], pages 177-192.