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

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	19
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	17
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	16
Transportkoncepter og IT-støtte: et undersøgelsesoplæg og nogle foreløbige resultater Ole Mortensen	14
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	14
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	13
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic Søren Bloch, Christian H. Christiansen	13
Reachability cuts for the vehicle routing problem with time windows Jens Lysgaard	13
K shortest paths in stochastic time-dependent networks Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen	13
Bicriterion a priori route choice in stochastic time-dependent networks. Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani	12
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	12
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands Christian H. Christiansen, Jens Lysgaard	12

Rank papers for other periods

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

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	55
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	50
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	49
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand Christian Larsen	48
Bicriterion a priori route choice in stochastic time-dependent networks. Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani	48
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott	48
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	47
Classification of routing and scheduling problems in liner shipping Karina Hjortshøj Kjeldsen	46
Reachability cuts for the vehicle routing problem with time windows Jens Lysgaard	45
A note on “Multicriteria adaptive paths in stochastic, time-varying networks” Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen	45

Rank papers for other periods

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

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

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	1040
Comments to Özkaya et al. (2006) Christian Larsen	1028
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	1012
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen, Anders Thorstenson	948
Business integration between manufacturing and transport-logistics firms Ole Mortensen, Olga W. Lemoine	916
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding Søren Glud Johansen, Anders Thorstenson	897
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	855
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem Adam N. Letchford, Jens Lysgaard, Richard W. Eglese	829
An inventory control project in a major Danish company using compound renewal demand models Christian Larsen, Claus Hoe Seiding, Christian Teller, Anders Thorstenson	826
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	809

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-04-01 06:29:57.