default search action
Journal of Heuristics, Volume 1
Volume 1, Number 1, September 1995
- Fred W. Glover:
Today's advances and tomorrow's challenges. 5-7 - Richard S. Barr, Bruce L. Golden, James P. Kelly, Mauricio G. C. Resende, William R. Stewart:
Designing and reporting on computational experiments with heuristic methods. 9-32 - John N. Hooker:
Testing heuristics: We have it all wrong. 33-42 - M. G. A. Verhoeven, Emile H. L. Aarts:
Parallel local search. 43-65 - Andrew I. Vakhutinsky, Bruce L. Golden:
A hierarchical strategy for solving traveling salesman problems using elastic nets. 67-76 - L. Darrell Whitley, J. Ross Beveridge, Christopher R. Graves, Keith E. Mathias:
Test driving three 1995 genetic algorithms: New test functions and geometric matching. 77-104 - Daniel Costa, Alain Hertz, Clivier Dubuis:
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs. 105-128 - Jadranka Skorin-Kapov, Jean-François P. Labourdette:
On minimum congestion routing in rearrangeable multihop lightwave networks. 129-145 - Yves Rochat, Éric D. Taillard:
Probabilistic diversification and intensification in local search for vehicle routing. 147-167
Volume 1, Number 2, March 1996
- Zbigniew Michalewicz:
Heuristic methods for evolutionary computation techniques. 177-206 - Stella C. S. Porto, Celso C. Ribeiro:
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. 207-223 - Mark A. Fleischer:
Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control. 225-246 - Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. 247-259
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.