Ausgabe 2/2011
Inhalt (8 Artikel)
A large neighbourhood search heuristic for the aircraft and passenger recovery problem
Serge Bisaillon, Jean-François Cordeau, Gilbert Laporte, Federico Pasin
An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser’s approach
Mostafa Khorramizadeh, Nezam Mahdavi-Amiri
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
Olivier Durand de Gevigney, Frédéric Meunier, Christian Popa, Julien Reygner, Ayrin Romero
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
Amir Salehipour, Kenneth Sörensen, Peter Goos, Olli Bräysy
Combinatorial and robust optimisation models and algorithms for railway applications
Laura Galli