HSF: the iOpt's framework to easily design metaheuristic methods
暂无分享,去创建一个
[1] Luca Di Gaspero,et al. EASYLOCAL++: an object‐oriented framework for the flexible design of local‐search algorithms , 2003, Softw. Pract. Exp..
[2] David L. Woodruff,et al. Optimization software class libraries , 2002 .
[3] Xin Yao,et al. Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.
[4] Celso C. Ribeiro,et al. An object-oriented framework for local search heuristics , 1998, Proceedings. Technology of Object-Oriented Languages. TOOLS 26 (Cat. No.98EX176).
[5] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[6] Raphaël Dorne,et al. iOpt: A Software Toolkit for Heuristic Search Methods , 2001, CP.
[7] Pascal Van Hentenryck,et al. Localizer: A Modeling Language for Local Search , 1999, INFORMS J. Comput..
[8] James E. Baker,et al. Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.
[9] Christos Voudouris,et al. Integrating Heuristic Search and One-Way Constraints in the Iopt Toolkit , 2003 .
[10] Marc Schoenauer,et al. Take It EASEA , 2000, PPSN.
[11] Laurent Michel,et al. A modeling language for local search , 1997 .
[12] Jin-Kao Hao,et al. A New Genetic Local Search Algorithm for Graph Coloring , 1998, PPSN.
[13] Stefan Voß,et al. Hotframe: A Heuristic Optimization Framework , 2003 .
[14] R. Shipman,et al. Eos — An Evolutionary and Ecosystem Research Platform , 2000 .
[15] Thomas Bäck,et al. Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.