Contributions
Heuristic aspects of exact algorithms for minimum sum-of-squares clustering
Daniel Aloise - École Polytechnique de Montréal, Canada
Pierre Hansen - GERAD and HEC Montréal, Canada
A Memory-based Multistart Heuristic for a Discrete Cost Multicommodity Network Design
Problem
Daniel Aloise - École Polytechnique de Montréal
Celso C. Ribeiro - Catholic University of Rio de Janeiro, Brazil
Heuristic Algorithms for the Non-Bifurcated Network Design Problem
Enrico Bartolini Dept. Computer Science, Univ. Bologna, Italy
Aristide Mingozzi Dept. Mathematics, Univ. Bologna, Italy
A Tabu Search Algorithm for the Single Vehicle Routing Allocation Problem
J.E. Beasley, C.A. Poojari - CARISMA, Mathematical Sciences, Brunel University, United Kingdom
L. Vogt - EPFL-SB-IMA, CH-1015 Lausanne, Switzerland
Slides
Exploring Graph Theory with AutoGraphiX
Gilles Caporossi GERAD and HEC Montreal, Canada
Pierre Hansen GERAD and HEC Montreal, Canada
Rim Kilani Ecole Polytechnique de Montreal, Canada
David Schindl HEC and Ecole Polytechnique de Montreal, Canada,
Slides
Large Neighbourhoods in Graph Colouring Problems: An Empirical Analysis
Marco Chiarandini University of Southern Denmark, Odense, Denmark
Irina Dumitrescu University of New South Wales, Sydney, Australia
Thomas Stuetzle Université Libre de Bruxelles, Brussels, Belgium,
Slides
On Optimized Crossover in Genetic Algorithms
Anton Eremeev - Omsk Branch of Sobolev Institute of Mathematics SB RAS, Russia
MIP models for MIP heuristics
Matteo Fischetti DEI, University of Padova, Italy
Andrea Lodi DEIS, University of Bologna and T.J. Watson Research Center, IBM,
Slides
Local Branching Cuts for the 0-1 Integer L-Shape Algorithm
Michel Gendreau - Université de Montréal, Canada
Walter Rei - Université de Montréal, Canada
Patrick Soriano - Université de Montréal, Canada
Slides
A Provably Convergent Heuristic for Bicriteria Stochastic Integer Programming
Walter J. Gutjahr - Department of Statistics and Decision Support Systems, University of Vienna, Austria
Recent results obtained with Primal-Dual VNS algorithms
Pierre Hansen - GERAD and HEC Montreal, Canada
Jack Brimberg - GERAD and Royal Military College of Canada
Dragan Uroevic - Mathematical Institute, SANU Belgrade
Nenad Mladenovic - GERAD and School of Mathematics, University of Birmingham, UK
Slides
Delivery Strategies for Periodic Blood Products Supplies
Karl F. Doerner, Richard F. Hartl, Vera Hemmelmayr - Department of Management Science, University of Vienna, Austria,
Martin W. P. Savelsbergh - The Logistics Institute, Georgia Institute of Technology, U.S.A.
Slides
Generalizations of the vehicle routing problem with time windows
Hideki Hashimoto - Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan
Toshihide Ibaraki - Kwansei Gakuin University, Japan
Shinji Imahori - Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
Mutsunori Yagiura - Graduate School of Information Science, Nagoya University, Nagoya, Japan
Slides
Metaheuristics/NLP Hybrids for Variants of the Rectangle Packing Problem
Toshihide Ibaraki - Kwansei Gakuin University, Japan
Slides
Decomposition, relaxation and metaheuristic generation
Roberto Baldacci, Marco Boschetti, Vittorio Maniezzo, Aristide Mingozzi - University of Bologna, Italy
Slides
Large Neighborhood Search in Scheduling an Air Taxi Service
George L. Nemhauser - Georgia Institute of Technology, U.S.A.
Slides
Feasibility and Improvement in Mixed Integer Programming: A Case Study
Marcus Poggi de Arag~ao - PUC-Rio, Brazil
Eduardo Uchoa - UFF, Brazil
Fernanda Menezes - GAPSO Inc., Brazil
Slides
Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems
Guenter Raidl - Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria
Slides
Using Local Search to Solve Some #P-complete Problems
Colin R. Reeves, M´eri´ema Aupetit-B´elaidouni Applied Mathematics Research Centre, Coventry University, UK
Slides
Combining Metaheuristics and Integer Programming on School Timetabling problems
Haroldo G. Santos, Luiz S. Ochi and Eduardo Uchoa - Universidade Federal Fluminense, Brazil
Slides
Hybridization of exact methods and metaheuristics for solving full truck load problems for ready-mixed concrete
Verena Schmid, Karl F. Doerner, Richard F. Hartl - Department of Business Administration, University of Vienna, Austria,
Martin W. P. Savelsbergh - School of Industrial and Systems Engineering, Georgia Institute of Technology, U.S.A.
Wolfgang Stoecher - Profactor Produktionsforschungs GmbH, Austria
Slides
Comparing mathematical, local search and hybrid heuristics for solving the minimum shift design problem with breaks
Wolfgang Slany - Institut für Softwaretechnologie, Technische Universität Graz, Austria
A guided local search based on a fast neighborhood search for the irregular strip packing problem
Shunji Umetani - Faculty of Electro-Communications, University of Electro-Communications, Chofu, Tokyo, Japan
Mutsunori Yagiura - Graduate School of Information Science, Nagoya University, Nagoya, Japan
Takashi Imamichi - Graduate School of Informatics, Kyoto University, Kyoto, Japan
Shinji Imahori - Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
Koji Nonobe - Faculty of Engineering, Hosei University, Koganei, Tokyo, Japan
Toshihide Ibaraki - School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan
Slides
Progressive Hedging as a Heuristic with Exact or Heuristic Solvers
David L. Woodruff - Graduate School of Management, U.C. Davis, U.S.A.
|
