Program

Sunday, August 24

• 16:00-19:00 Registration
  
  
  
  
• 19:00 Welcome Reception
  
  
  
  

Monday, August 25

• 9:00-9:15 Opening
  
  
  
  
• 9:15-10:30 Location 1
  
  
  • Solving the p -median problem via a radius formulation
    S. Garc�a, M. Labb�, A. Mar�n
  • Minimax Regret Path Location on Trees
    J. Puerto, F. Ricca, A. Scozzari
  • A computational comparison of several formulations for the multi-period incremental service facility location problem
    M. Albareda-Sambola, A. Alonso-Ayuso, L. F. Escudero, E. Fern�ndez, Y. Hinojosa, C. Pizarro
  
  
• 10:30-11:00 Coffee Break
  
  
  
  
• 11:00-12:45 Routing
  
  
  • The Livestock Collection Problem
    A. L�kketangen, J. Oppen
  • The m -Capacitated Peripatetic Salesman Problem
    E. Duchenne, G. Laporte, F. Semet
  • The Clustered Prize-collecting Arc Routing Problem
    J. Ar�oz, E. Fern�ndez, C. Franquesa
  • Some new attemps to deal with integer multicommodity flow routing problems
    E. Gourdin
  
  
• 12:45-14:15 Lunch
  
  
  
  
• 14:15-15:30 Stochastic Optimization
  
  
  • A Progressive Hedging Meta-heuristic for Stochastic Network Design
    T.G. Crainic, X. Fu, M. Gendreau, and W. Rei
  • Online optimization: Some recent results
    P. Jaillet
  • A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands
    M. Gendreau, W. Rei, P. Soriano
  
  
• 15:30-16:00 Coffee Break
  
  
  
  
• 16:00-17:00 Models for Competition
  
  
  • Game Theoretic Models for Competition in Public Transit Services
    E. Y. S. Chan, J. M.Y. Leung
  • What about movies reviewer quotations?
    P. Van Asbroeck
  
  
• 17:00 Social activity
  
  
  
  

Tuesday, August 26

• 9:00-10:15 Location 2
  
  
  • On the Minimum-Envy Location Problem
    A. Mar�n, I. Espejo, J. Puerto, A. Rodr�guez-Ch�a
  • Discretized Reformulations for a capacitated network loading problem arising in a facility location contex
    I. Correia, L. Gouveia, F. Saldanha-da-Gama
  • Discrete Ordered Median Problems: Models, Solution Techniques and Extensions
    A. Mar�n, S. Nickel, J. Puerto, S. Velten
  
  
• 10:15-10:45 Coffee Break
  
  
  
  
• 10:45-12:30 Combinatorial Optimization 1
  
  
  • Linear Relaxations for the Maximum Stable Set Problem: a computational study
    M. Giandomenico, A. N. Letchford, F. Rossi, S. Smriglio
  • Approaches for a Single-Source Network-Loading Problem
    I. Ljubic, P. Putz, I. Rodr�guez, J.J. Salazar
  • On the Pattern Minimisation Problem
    A. Aloisio , C. Arbib, F. Marinelli
  • Spanning trees with node degree dependent costs and knapsack reformulations
    L. Gouveia, Pedro Moura
  
  
• 12:30-14:00 Lunch
  
  
  
  
• 14:00-15:45 Combinatorial Optimization 2
  
  
  • Three little octagons
    C. Audet, P. Hansen, F. Messine
  • The Uncapacitated Swapping Problem on Linear and Circular Tracks
    S. Anily, A. Pfeffer
  • Formal Languages for Integer Programming Modeling of Shift Scheduling Problems
    M.-C. C�t�, B. Gendron, C.-G. Quimper, L.-M. Rousseau
  • A better polynomial-time algorithm for finding minimum cycle bases in undirected graphs
    E. Amaldi, C. Iuliano, R. Rizzi
  
  
• 15:45-16:15 Coffee Break
  
  
  
  
• 16:15-17:15 Nonlinear Optimization
  
  
  • A heuristic for nonlinear global optimization
    M. Bierlaire, M.Th�mans, N. Zufferey
  • Some new developements in nonlinear programming
    P. Toint
  
  
• 19:00 Conference Dinner
  
  
  
  

Wednesday, August 27

• 9:00-10:45 Pricing and Auctions
  
  
  • Inventory and pricing issues in media broadcasting
    N. Chan, P. Marcotte, G. Savard
  • Pricing American Contingent Claims by Linear Integer Programming
    M. C. Pinar
  • A new formulation for the Winner Determination Problem
    M. Landete, J.F. Monge, A.M. Rodr�gez-Ch�a
  • A parallel between two models in Economics and OR: Product Line Design versus Bilevel Price Optimization
    G. Heilporn, M. Labb�, P. Marcotte, G. Savard
  
  
• 10:45-11:15 Coffee Break
  
  
  
  
• 11:15-12:15 Heuristics and Applications
  
  
  • Evolution of Fitness Functions to Enhance Heuristics
    P. Cowling, K. Dahal, S. Remde, N. Colledge
  • Operations Research Applications in Canada's Department of National Defence
    R. S�guin
  
  
• 12:15-13:45 Lunch
  
  
  
  
• 13:45-15:00 Combinatorial Optimization 3
  
  
  • A branch and cut algorithm to optimize sensor installation in a network
    P. Meurdesoif, P. Pesneau, F. Vanderbeck
  • Polyhedral Analysis for the Two Item Uncapacitated Lot Sizing Problem with One Way Substitution
    H. Yaman
  • The k edge-disjoint 3-hop-constrained paths polytope
    F. Bendali, I. Diarrassouba, A.R. Mahjoub, J. Mailfert