Fulltext files are files downloaded from the S-WoBA server, Redirected files are files downloaded from a server maintained by the publisher of a working paper series.

The statistics for 2010-06, 2012-04 (half month), 2012-05 and 2012-06 have unfortunately been lost. We regret this.

The raw data

The raw data

Top papers by Abstract Accesses last month (2026-03)

Paper	Accesses
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, Anders Thorstenson	47
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	37
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	31
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	29
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	28
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, Diogo Andrade	25
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	24
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	21
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	20
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands Christian H. Christiansen, Jens Lysgaard	20

Rank papers for other periods

Top papers by Downloads last month (2026-03)

Paper	Downloads
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	25
K shortest paths in stochastic time-dependent networks Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	24
Comments to Özkaya et al. (2006) Christian Larsen	20
Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang. Christian Larsen, Gudrun P. Kiesmüller	19
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	17
Reachability cuts for the vehicle routing problem with time windows Jens Lysgaard	13
Note: Comments on the paper by Rosling (2002) Christian Larsen	12
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, Diogo Andrade	12
Transportkoncepter og IT-støtte: et undersøgelsesoplæg og nogle foreløbige resultater Ole Mortensen	12
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	11
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	11
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	11

Rank papers for other periods

Top papers by Abstract Accesses last 3 months (2026-01 to 2026-03)

Paper	Accesses
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, Anders Thorstenson	143
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	92
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	85
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	85
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	73
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	73
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, Diogo Andrade	72
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	66
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	65
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	64
Bicriterion a priori route choice in stochastic time-dependent networks. Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani	64

Rank papers for other periods

Top papers by Downloads last 3 months (2026-01 to 2026-03)

Paper	Downloads
K shortest paths in stochastic time-dependent networks Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	33
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	28
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	22
Comments to Özkaya et al. (2006) Christian Larsen	21
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	21
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	21
Polyhedral Computations for the Simple Graph Partitioning Problem Michael M. Sørensen	20
Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang. Christian Larsen, Gudrun P. Kiesmüller	20
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	20
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, Diogo Andrade	19

Rank papers for other periods

Top papers by Abstract Accesses all months (from 2006-03)

Paper	Accesses
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, Anders Thorstenson	1405
Comments to Özkaya et al. (2006) Christian Larsen	1298
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	1265
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	1149
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	1147
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	1082
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	1078
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, Diogo Andrade	1067
Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang. Christian Larsen, Gudrun P. Kiesmüller	1015
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	1014

Rank papers for other periods

Top papers by Downloads all months (from 2006-03)

Paper	Downloads
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	231
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, Anders Thorstenson	182
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	130
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands Christian H. Christiansen, Jens Lysgaard	124
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	119
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	115
Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang. Christian Larsen, Gudrun P. Kiesmüller	110
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	107
An inventory control project in a major Danish company using compound renewal demand models Christian Larsen, Claus Hoe Seiding, Christian Teller, Anders Thorstenson	105
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	105

Rank papers for other periods

• University of Aarhus, Aarhus School of Business, Department of Business Studies
• Home page for this series

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 2026-04-01 05:56:43.