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-07)

Paper	Accesses
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	85
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	40
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	28
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	24
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	24
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	23
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	21
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	21
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	20
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	19

Rank papers for other periods

Top papers by Downloads last month (2026-07)

Paper	Downloads
A note on “Multicriteria adaptive paths in stochastic, time-varying networks” Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen	4
K shortest paths in stochastic time-dependent networks Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	3
Reachability cuts for the vehicle routing problem with time windows Jens Lysgaard	2
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	2
An inventory control project in a major Danish company using compound renewal demand models Christian Larsen, Claus Hoe Seiding, Christian Teller, Anders Thorstenson	2
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	1
Classification of routing and scheduling problems in liner shipping Karina Hjortshøj Kjeldsen	1
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	1
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	1
Streams of events and performance of queuing systems: The basic anatomy of arrival/departure processes, when focus is set on autocorrelation Erland Hejn Nielsen	1
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	1
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	1
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands Christian H. Christiansen, Jens Lysgaard	1
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	1
Bicriterion a priori route choice in stochastic time-dependent networks. Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani	1
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	1

Rank papers for other periods

Top papers by Abstract Accesses last 3 months (2026-05 to 2026-07)

Paper	Accesses
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	132
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	110
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	108
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	98
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	95
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	79
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	78
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	75
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	73
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	69

Rank papers for other periods

Top papers by Downloads last 3 months (2026-05 to 2026-07)

Paper	Downloads
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	19
Streams of events and performance of queuing systems: The basic anatomy of arrival/departure processes, when focus is set on autocorrelation Erland Hejn Nielsen	19
Note: Comments on the paper by Rosling (2002) Christian Larsen	18
A note on “Multicriteria adaptive paths in stochastic, time-varying networks” Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen	18
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	17
The Q(s,S) control policy for the joint replenishment problem extended to the case of correlation among item-demands Christian Larsen	16
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	15
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	14
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	14
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	14

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	1579
Comments to Özkaya et al. (2006) Christian Larsen	1395
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	1379
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	1284
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	1251
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	1235
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	1235
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	1187
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	1138
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	1111

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	255
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	208
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	159
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands Christian H. Christiansen, Jens Lysgaard	147
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	147
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	147
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	133
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	129
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	125
An inventory control project in a major Danish company using compound renewal demand models Christian Larsen, Claus Hoe Seiding, Christian Teller, Anders Thorstenson	119

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-08-01 10:33:49.