CORAL Working Papers

From University of Aarhus, Aarhus School of Business, Department of Business Studies
The Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark.
Contact information at EDIRC.
Bibliographic data for series maintained by Helle Vinbaek Stenholt ( this e-mail address is bad, please contact ).

Access Statistics for this working paper series.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.

L-2008-09: Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation: Ellis L. Johnson and Sanne Wøhlk
L-2008-08: Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic: Søren Bloch and Christian H. Christiansen
L-2008-07: Base stock policies with degraded service to larger orders: Bisheng Du and Christian Larsen
L-2008-06: Classification of routing and scheduling problems in liner shipping: Karina Hjortshøj Kjeldsen
L-2008-05: Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks: Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen and Matthias Ehrgott
L-2008-04: Comments to Özkaya et al. (2006): Christian Larsen
L-2008-03: Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand: Christian Larsen
L-2008-02: The Pyramidal Capacitated Vehicle Routing Problem: Jens Lysgaard
L-2008-01: Scheduling participants of Assessment Centres: Jens Lysgaard and Janni Løber
L-2007-03: Note: Comments on the paper by Rosling (2002): Christian Larsen
L-2007-02: An inventory control project in a major Danish company using compound renewal demand models: Christian Larsen, Claus Hoe Seiding, Christian Teller and Anders Thorstenson
L-2007-01: The Q(s,S) control policy for the joint replenishment problem extended to the case of correlation among item-demands: Christian Larsen
L-2006-11: A note on “Multicriteria adaptive paths in stochastic, time-varying networks”: Daniele Pretolani, Lars Relund Nielsen and Kim Allan Andersen
L-2006-10: Bicriterion a priori route choice in stochastic time-dependent networks: Lars Relund Nielsen, Kim Allan Andersen and Daniele Pretolani
L-2006-09: 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
L-2006-08: 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
L-2006-07: Column generation approaches to ship scheduling with flexible cargo sizes: Geir Brønmo, Bjørn Nygreen and Jens Lysgaard
L-2006-06: A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem: Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
L-2006-05: Business integration between manufacturing and transport-logistics firms: Ole Mortensen and Olga W. Lemoine
L-2006-04: A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands: Christian H. Christiansen and Jens Lysgaard
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: Christian Larsen
L-2006-02: Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times: Søren Glud Johansen and Anders Thorstenson
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: Christian Larsen and Anders Thorstenson
L-2005-02: Polyhedral Computations for the Simple Graph Partitioning Problem: Michael M. Sørensen
L-2005-01: Transportkoncepter og IT-støtte: et undersøgelsesoplæg og nogle foreløbige resultater: Ole Mortensen
L-2004-05: K shortest paths in stochastic time-dependent networks: Lars Relund Nielsen, Daniele Pretolani and Kim Allan Andersen
L-2004-04: Finding the K shortest hyperpaths using reoptimization: Lars Relund Nielsen, Daniele Pretolani and Kim Allan Andersen
L-2004-03: The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding: Søren Glud Johansen and Anders Thorstenson
L-2004-02: Streams of events and performance of queuing systems: The basic anatomy of arrival/departure processes, when focus is set on autocorrelation: Erland Hejn Nielsen
L-2004-01: Reachability cuts for the vehicle routing problem with time windows: Jens Lysgaard