Fulltext files are files downloaded from the EBLSG 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-02)

Paper	Accesses
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	36
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	35
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	32
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	30
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	26
The Q(s,S) control policy for the joint replenishment problem extended to the case of correlation among item-demands Christian Larsen	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
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	22
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	21
Reachability cuts for the vehicle routing problem with time windows Jens Lysgaard	21
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	21

Rank papers for other periods

Top papers by Downloads last month (2026-02)

Paper	Downloads
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	13
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	9
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	8
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	8
K shortest paths in stochastic time-dependent networks Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	8
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	7
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	7
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	7
Polyhedral Computations for the Simple Graph Partitioning Problem Michael M. Sørensen	6
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	4

Rank papers for other periods

Top papers by Abstract Accesses last 3 months (2025-12 to 2026-02)

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	146
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	89
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	86
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	82
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	82
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	79
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	79
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	74
Bicriterion a priori route choice in stochastic time-dependent networks. Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani	73
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	71

Rank papers for other periods

Top papers by Downloads last 3 months (2025-12 to 2026-02)

Paper	Downloads
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	19
Polyhedral Computations for the Simple Graph Partitioning Problem Michael M. Sørensen	18
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	15
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	14
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	13
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	11
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	11
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	10
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	10
K shortest paths in stochastic time-dependent networks Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	9

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

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

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-03-01 05:51:58.