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 (2025-01)

Paper	Accesses
A note on “Multicriteria adaptive paths in stochastic, time-varying networks” Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen	20
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	19
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	17
Streams of events and performance of queuing systems: The basic anatomy of arrival/departure processes, when focus is set on autocorrelation Erland Hejn Nielsen	16
Classification of routing and scheduling problems in liner shipping Karina Hjortshøj Kjeldsen	16
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	16
Reachability cuts for the vehicle routing problem with time windows Jens Lysgaard	15
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands Christian H. Christiansen, Jens Lysgaard	15
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	15
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	15
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	15

Rank papers for other periods

Top papers by Downloads last month (2025-01)

Paper	Downloads
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	1
Polyhedral Computations for the Simple Graph Partitioning Problem Michael M. Sørensen	1
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	1

Rank papers for other periods

Top papers by Abstract Accesses last 3 months (2024-11 to 2025-01)

Paper	Accesses
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	43
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	41
Streams of events and performance of queuing systems: The basic anatomy of arrival/departure processes, when focus is set on autocorrelation Erland Hejn Nielsen	40
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	40
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	39
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	39
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	36
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands Christian H. Christiansen, Jens Lysgaard	35
Reachability cuts for the vehicle routing problem with time windows Jens Lysgaard	35
A note on “Multicriteria adaptive paths in stochastic, time-varying networks” Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen	34
Polyhedral Computations for the Simple Graph Partitioning Problem Michael M. Sørensen	34

Rank papers for other periods

Top papers by Downloads last 3 months (2024-11 to 2025-01)

Paper	Downloads
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands Christian H. Christiansen, Jens Lysgaard	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	3
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	2
Scheduling participants of Assessment Centres Jens Lysgaard, Janni Løber	2
Base stock policies with degraded service to larger orders Bisheng Du, Christian Larsen	1
K shortest paths in stochastic time-dependent networks Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	1
Polyhedral Computations for the Simple Graph Partitioning Problem Michael M. Sørensen	1
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
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation Ellis L. Johnson, Sanne Wøhlk	1
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	1
Finding the K shortest hyperpaths using reoptimization Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	1
Transportkoncepter og IT-støtte: et undersøgelsesoplæg og nogle foreløbige resultater Ole Mortensen	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
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	1
Comments to Özkaya et al. (2006) Christian Larsen	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
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	1
A note on “Multicriteria adaptive paths in stochastic, time-varying networks” Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen	1
The Pyramidal Capacitated Vehicle Routing Problem Jens Lysgaard	1
Classification of routing and scheduling problems in liner shipping Karina Hjortshøj Kjeldsen	1
The Q(s,S) control policy for the joint replenishment problem extended to the case of correlation among item-demands Christian Larsen	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
An inventory control project in a major Danish company using compound renewal demand models Christian Larsen, Claus Hoe Seiding, Christian Teller, Anders Thorstenson	1
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	1
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	1
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	1
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	1
Bicriterion a priori route choice in stochastic time-dependent networks. Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani	1
Note: Comments on the paper by Rosling (2002) Christian Larsen	1

Rank papers for other periods

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

Paper	Accesses
Column generation approaches to ship scheduling with flexible cargo sizes Geir Brønmo, Bjørn Nygreen, Jens Lysgaard	1012
Comments to Özkaya et al. (2006) Christian Larsen	1004
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	983
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	923
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	889
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	865
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	825
An inventory control project in a major Danish company using compound renewal demand models Christian Larsen, Claus Hoe Seiding, Christian Teller, Anders Thorstenson	804
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	798
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	768

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

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 2025-02-01 06:17:39.