Dispatching Buses in Parking Depots

References

  • Avriel M., Penn M. Exact and approximate solutions of the container ship stowage problem. Comput. Indust. Engrg. (1995) 25:271–274CrossrefGoogle Scholar
  • Frangioni A. Generalized bundle methods. (Dip. di Informatica, Univ.Pisa, Pisa, Italy) . Technical Report 04/98Google Scholar
  • Frangioni A., Gallo G. A bundle type dual-ascent approach to linear multicommodity min-cost flow problems. INFORMS J. Comput. (1999) 11:370–393LinkGoogle Scholar
  • Guignard M., Kim S. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math. Programming (1987) 39:215–228CrossrefGoogle Scholar
  • Malucelli F., Ottmann T., Pretolani D. Efficient labelling algorithms for the maximum noncrossing matching problem. Discrete Appl. Math. (1993) 47:175–179CrossrefGoogle Scholar
  • Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. (1997) 45:831–841LinkGoogle Scholar
  • Winter T., Zimmermann U. T. Real-time dispatch of trams in storage yards. Ann. Oper. Res. (2000) 96:287–315CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.