Volume 183, Issue 1

March 2011

Adaptive Memory Programming: Methods and Algorithms for Hard Combinatorial Problems

Issue Editor:

9 articles in this issue

Preface
César Rego
EditorialNotes 21 December 2010 Pages: 1 - 5
Adaptive memory programming for matrix bandwidth minimization
Vicente Campos
Estefanía Piñana
Rafael Martí
OriginalPaper 29 May 2009 Pages: 7 - 23
Tabu search approaches for solving the two-group classification problem
Saïd Hanafi
Nicola Yanev
OriginalPaper 23 June 2009 Pages: 25 - 46
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
Fred Glover
Lawrence H. Cox
James P. Kelly
OriginalPaper 29 May 2009 Pages: 47 - 73
Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction
Jacek Blazewicz
Piotr Formanowicz
Przemyslaw Taront
OriginalPaper Open access 18 September 2010 Pages: 75 - 94
Hybrid scatter tabu search for unconstrained global optimization
Abraham Duarte
Rafael Martí
Francisco Gortazar
OriginalPaper 08 August 2009 Pages: 95 - 123
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Saïd Hanafi
Christophe Wilbaut
OriginalPaper 27 May 2009 Pages: 125 - 142
A GRASP-based approach for technicians and interventions scheduling for telecommunications
Hideki Hashimoto
Sylvain Boussier
Christophe Wilbaut
OriginalPaper 20 May 2009 Pages: 143 - 161
The case for strategic oscillation
Fred Glover
Jin-Kao Hao
OriginalPaper 07 August 2009 Pages: 163 - 173

Search