3 Presentations

• 
  08:00 AM - 08:30 AM

  Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem

  • Yuya Masumura, presenter, Osaka University
  • Taihei Oki, The University of Tokyo
  • Yutaro Yamaguchi, Osaka University
• 
  08:30 AM - 09:00 AM

  On Finding Shortest Paths in Arc-Dependent Networks

  • Wojciechowski Piotr, West Virginia University
  • Williamsom Matthew, Marietta College
  • K. Subramani, presenter, West Virginia University
• 
  09:00 AM - 09:30 AM

  Quasi-Separable Dantzig-Wolfe Reformulations for Network Design

  • Antonio Frangioni, presenter, Università di Pisa
  • Bernard Gendron, Université de Montréal, CIRRELT
  • Enrico Gorgone, Università della Calabria