A Branch-and-Cut Algorithm for the Median-Path Problem Pasquale AvellaMaurizio BocciaIgor Vasil'Ev OriginalPaper Pages: 215 - 230
Expanding Neighborhood GRASP for the Traveling Salesman Problem Yannis MarinakisAthanasios MigdalasPanos M. Pardalos OriginalPaper Pages: 231 - 257
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it J. A. J. HallK. I. M. McKinnon OriginalPaper Pages: 259 - 283
Iterative Convex Quadratic Approximation for Global Optimization in Protein Docking Roummel F. MarciaJulie C. MitchellJ. Ben Rosen OriginalPaper Pages: 285 - 297
Minimizing Labor Requirements in a Periodic Vehicle Loading Problem Cristina DelgadoManuel LagunaJoaquĆn Pacheco OriginalPaper Pages: 299 - 320