Journal of Heuristics, Volume 10

Volume 10, Number 1, January 2004

H. Edwin Romeijn, Dolores Romero Morales:
Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case. 5-35
Yong-Hyuk Kim, Byung Ro Moon:
Lock-Gain Based Graph Partitioning. 37-57
Mauricio G. C. Resende, Renato Fonseca F. Werneck:
A Hybrid Heuristic for the p-Median Problem. 59-88
Federico Della Croce, Marco Ghirardi, Roberto Tadei:
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems. 89-104

Yong-Hyuk Kim, Byung Ro Moon:
Investigation of the Fitness Landscapes in Graph Bipartitioning: An Empirical Study. 111-133
Andrea Grosso, Marco Locatelli, Federico Della Croce:
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. 135-152
A. J. Richmond, J. E. Beasley:
An Iterative Construction Heuristic for the Ore Selection Problem. 153-167
Mauro Dell'Amico, Manuel Iori, Silvano Martello:
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||C_max Problem. 169-204
Adriana C. F. Alvim, Celso C. Ribeiro, Fred Glover, Dario J. Aloise:
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem. 205-229

Enrique Alba:
Introduction. 239-241
Michael Affenzeller, Stefan Wagner:
SASEGASA: A New Generic Parallel Evolutionary Algorithm for Achieving Highest Quality Results. 243-267
Mehmet Emin Aydin, Terence C. Fogarty:
A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems. 269-292
Teodor Gabriel Crainic, Michel Gendreau, Pierre Hansen, Nenad Mladenovic:
Cooperative Parallel Variable Neighborhood Search for the p-Median. 293-314
Raul Baños, Consolación Gil, Julio Ortega, Francisco G. Montoya:
A Parallel Multilevel Metaheuristic for Graph Partitioning. 315-336
Shan-Tai Chen, Shun-Shii Lin, Li-Te Huang, Chun-Jen Wei:
Towards the Exact Minimization of BDDs-An Elitism-Based Distributed Evolutionary Algorithm. 337-355
Sébastien Cahon, Nordine Melab, El-Ghazali Talbi:
ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. 357-380

Sheldon H. Jacobson, Enver Yücesan:
Analyzing the Performance of Generalized Hill Climbing Algorithms. 387-405
Michel Vasquez:
New Results on the Queens_n² Graph Coloring Problem. 407-413
Paulo Cortez, Miguel Rocha, José Neves:
Evolving Time Series Forecasting ARMA Models. 415-429
Fernando Fernández, Pedro Isasi:
Evolutionary Design of Nearest Prototype Classifiers. 431-454

Vinícius Amaral Armentano, José Elias Claudio Arroyo:
An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem. 463-481
Luciana S. Buriol, Paulo M. França, Pablo Moscato:
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem. 483-506
Masaya Mito, Satoshi Fujita:
On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions. 507-523
Teodor Gabriel Crainic, Bernard Gendron, Geneviève Hernu:
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design. 525-545

Cristian Munteanu, Agostinho C. Rosa:
Adaptive Reservoir Evolutionary Algorithm: An Evolutionary On-Line Adaptation Scheme for Global Function Optimization. 555-586
Olli Bräysy, Wout Dullaert, Michel Gendreau:
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows. 587-611
Michael Polacek, Richard F. Hartl, Karl Doerner, Marc Reimann:
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. 613-627
Jano I. van Hemert, Thomas Bäck:
Robust Parameter Settings for Variation Operators by Measuring the Resampling Ratio: A Study on Binary Constraint Satisfaction Problems. 629-640