Matheuristics 2008: accepted presentations.

Schedule of the presentations

  1. Kernel Search: A Heuristic Framework for MILP Problems with Binary Variables
    Enrico Angelelli, Renata Mansini, and M. Grazia Speranza (abstract)
  2. An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem
    Claudia Archetti, Martin Savelsbergh, and M. Grazia Speranza (abstract)
  3. An Iterated Local Search Algorithm for a Real-Life Break Scheduling Problem
    Andreas Beer, Johannes Gartner, Nysret Musliu, Werner Schafhauser and Wolfgang Slany (abstract)
  4. Distributed Lagrangean Optimization: a case in P2P Overlay Network Design
    Marco A. Boschetti, Vittorio Maniezzo and Matteo Roffilli (abstract)
  5. The Corridor Method - A General Solution Concept with Application to the Blocks Relocation Problem
    Marco Caserta, Stefan Voss, and Moshe Sniedovich (abstract)
  6. MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines
    A. Dolgui, O. Guschinskaya, A. Eremeev (abstract)
  7. Feasibility Pump Revised
    Matteo Fischetti and Domenico Salvagnin (abstract)
  8. A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands
    Michel Gendreau, Walter Rei and Patrick Soriano (abstract)
  9. (Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem
    Martin Gruber and Guenther R. Raidl (abstract)
  10. A good recipe for solving MINLPs
    Leo Liberti, Giacomo Nannicini and Nenad Mladenovic (abstract)
  11. Using heuristics and mixed-integer programming in chemical graph theory
    Pierre Hansen, Gilles Caporossi and Damir Vukicevic (abstract)
  12. Combining Exact and Heuristic Approaches for the Fixed Charge Network Flow Problem
    Mike Hewitt, George Nemhauser, and Martin Savelsbergh (abstract)
  13. A metaheuristic for stochastic service network design
    Arild Hoff, Arnt-Gunnar Lium, Arne Løkketangen, and Theodor Crainic (abstract)
  14. Variable Intensity Local Search
    Snezana Mitrovic-Minic and Abraham P. Punnen (abstract)
  15. Hybridizing population heuristics and column generation for the Bin Packing Problem with Confliicts
    Albert E. Fernandes Muritiba, Manuel Iori, Enrico Malaguti and Paolo Toth (abstract)
  16. A hybrid tabu search for the m-peripatetic vehicle routing problem
    Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler-Calvo (abstract)
  17. Basic Heuristic Semantic Techniques for Structured MIPS
    Marcus Poggi, Eduardo Uchoa, Lorenza Moreno and Marcelo Reis (abstract)
  18. An ILP Improvement Procedure for the Open Vehicle Routing Problem
    Majid Salari, Paolo Toth, and Andrea Tramontani (abstract)
  19. Hybridization of Local Branching guided by Variable Neighborhood Search for Ready-Mixed Concrete Delivery Problems
    Verena Schmid, Karl F. Doerner, Richard F. Hartl, Juan-Jose Salazar Gonzalez (abstract)
  20. A Hybrid Algorithm for an Inventory Routing Problem
    M. Grazia Speranza, Claudia Archetti, Luca Bertazzi, and Alain Hertz (abstract)
  21. Applications of estimation-based SLS algorithms to stochastic routing problems
    Thomas Stuetzle, P. Balaprakash, Mauro Birattari, and Marco Dorigo (abstract)
  22. Heuristic, Exact and Hybrid Methods for the Multi- Pile Vehicle Routing Problem
    Fabien Tricoire, Karl F. Doerner, Richard F. Hartl, Manuel Iori (abstract)

Schedule of the presentations