No L-2006-11: A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
Daniele Pretolani, Lars Relund Nielsen and Kim Allan Andersen
No L-2006-10: Bicriterion a priori route choice in stochastic time-dependent networks.
Lars Relund Nielsen, Kim Allan Andersen and Daniele Pretolani
No L-2006-9: Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang.
Christian Larsen and Gudrun P. Kiesmüller
No L-2006-8: Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation
Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Pessoa, Marcus Poggi de Aragão and Diogo Andrade
No L-2006-7: Column generation approaches to ship scheduling with flexible cargo sizes
Geir Brønmo, Bjørn Nygreen and Jens Lysgaard
No L-2006-6: A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
No L-2006-5: Business integration between manufacturing and transport-logistics firms
Ole Mortensen and Olga W. Lemoine
No L-2006-4: A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands
Christian H. Christiansen and Jens Lysgaard
No L-2006-2: Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times
Søren Glud Johansen and Anders Thorstenson
No L-2006-1: A comparison between the order and the volume fill rates for a base-stock inventory control system under a compound renewal demand process
Christian Larsen and Anders Thorstenson
Questions (including download problems) about the papers in this series should be directed to Helle Vinbaek Stenholt ()
Report other problems with accessing this service to Sune Karlsson ().
This page generated on 2018-02-07 11:42:51.