Program for stream Discrete optimization - Computational methods

MB-17: TSP and VRP
Stream: Discrete optimization - Computational methods
Room: 309A
Chair(s): Stefan Ropke

• Solving time-dependent traveling salesman problem with time windows with dynamic discretization discovery
  Duc Minh Vu, Natashia Boland, Mike Hewitt, Martin Savelsbergh
• On solvable cases of the shortest TSP-path problem
  Vladimir Deineko
• Quality of bound versus running time of the branch-and-bound algorithm: A computational experiment
  Stefan Ropke

MD-17: Non-linear discrete optimization, facets, enumeration and linearization
Stream: Discrete optimization - Computational methods
Room: 309A
Chair(s): João Lauro Faco'

• Integer L-shaped algorithm and MISOCP for nonlinear network design problem
  Emine Gundogdu, Sinan Gürel
• Complex MINLP by the generalized-CGRASP method
  João Lauro Faco', Ricardo Silva, Mauricio Resende
• Linearization and quadratization techniques for multilinear 0-1 optimization problems
  Elisabeth Rodriguez-Heck, Yves Crama
• Getting strong bounds for the crossdock door assignment problem using a Lagrangean relaxation of an RLT model having the 0-1 ILP
  Jongwoo Park, Monique Guignard-Spielberg