Contact information of University of Aarhus, Aarhus School of Business, Department of Business Studies
Corrections
All material on this site has been provided by the respective publishers and authors. You can help
correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hhb:aarbls. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Helle Vinbaek Stenholt (email available below). General contact details of provider: https://edirc.repec.org/data/ifhhadk.html .
Content
2009
2008
- L-2008-08 Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic
by Bloch, Søren & Christiansen, Christian H.
- L-2008-07 Base stock policies with degraded service to larger orders
by Du, Bisheng & Larsen, Christian
- L-2008-06 Classification of routing and scheduling problems in liner shipping
by Kjeldsen, Karina Hjortshøj
- L-2008-05 Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks
by Pretolani, Daniele & Nielsen, Lars Relund & Andersen, Kim Allan & Ehrgott, Matthias
- L-2008-04 Comments to Özkaya et al. (2006)
by Larsen, Christian
- L-2008-03 Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand
by Larsen, Christian
- L-2008-02 The Pyramidal Capacitated Vehicle Routing Problem
by Lysgaard, Jens
- L-2008-01 Scheduling participants of Assessment Centres
by Lysgaard, Jens & Løber, Janni
2007
2006
- L-2006-11 A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
by Pretolani, Daniele & Nielsen, Lars Relund & Andersen, Kim Allan
- L-2006-10 Bicriterion a priori route choice in stochastic time-dependent networks
by Nielsen, Lars Relund & Andersen, Kim Allan & Pretolani, Daniele
- L-2006-09 Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang
by Larsen, Christian & Kiesmüller, Gudrun P.
- L-2006-08 Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation
by Uchoa, Eduardo & Fukasawa, Ricardo & Lysgaard, Jens & Pessoa, Artur & Poggi de Aragão, Marcus & Andrade, Diogo
- L-2006-07 Column generation approaches to ship scheduling with flexible cargo sizes
by Brønmo, Geir & Nygreen, Bjørn & Lysgaard, Jens
- L-2006-06 A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
by Letchford, Adam N. & Lysgaard, Jens & Eglese, Richard W.
- L-2006-05 Business integration between manufacturing and transport-logistics firms
by Mortensen, Ole & Lemoine, Olga W.
- L-2006-04 A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands
by Christiansen, Christian H. & Lysgaard, Jens
- L-2006-03 Computation of order and volume fill rates for a base stock inventory control system with heterogeneous demand to investigate which customer class gets the best service
by Larsen, Christian
- L-2006-01 A comparison between the order and the volume fill rates for a base-stock inventory control system under a compound renewal demand process
by Larsen, Christian & Thorstenson, Anders
2005
2004
- L-2004-05 K shortest paths in stochastic time-dependent networks
by Nielsen, Lars Relund & Pretolani, Daniele & Andersen, Kim Allan
- L-2004-04 Finding the K shortest hyperpaths using reoptimization
by Nielsen, Lars Relund & Pretolani, Daniele & Andersen, Kim Allan
- L-2004-03 The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding
by Johansen, Søren Glud & Thorstenson, Anders
- L-2004-02 Streams of events and performance of queuing systems: The basic anatomy of arrival/departure processes, when focus is set on autocorrelation
by Nielsen, Erland Hejn
- L-2004-01 Reachability cuts for the vehicle routing problem with time windows
by Lysgaard, Jens