EBSLG

 

 
European Business Schools Librarian's Group
Home About Series Subject/JEL codes Advanced Search
Department of Business Studies, Aarhus School of Business, University of Aarhus CORAL Working Papers, Department of Business Studies, Aarhus School of Business, University of Aarhus

Downloads from EBSLG

Number of downloads from EBSLG

Fulltext files and Additional files (supplementary files) are files downloaded from the EBSLG server, Redirected files are files downloaded from a server maintained by Department of Business Studies, Aarhus School of Business, University of Aarhus.
The statistics for 2010-06, 2012-04 (half month), 2012-05 and 2012-06 have unfortunately been lost. We regret this.

The raw data

Papers at EBSLG

Number of papers at EBSLG

The raw data

 

Top 10 Papers by Abstract Accesses Last Month (2017-03)

PaperAccesses
Note: Comments on the paper by Rosling (2002)
Christian Larsen
8
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
7
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 and Anders Thorstenson
6
Finding the K shortest hyperpaths using reoptimization
Lars Relund Nielsen, Daniele Pretolani and Kim Allan Andersen
6
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand
Christian Larsen
6
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding
Søren Glud Johansen and Anders Thorstenson
5
Column generation approaches to ship scheduling with flexible cargo sizes
Geir Brønmo, Bjørn Nygreen and Jens Lysgaard
5
Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang.
Christian Larsen and Gudrun P. Kiesmüller
5
An inventory control project in a major Danish company using compound renewal demand models
Christian Larsen, Claus Hoe Seiding, Christian Teller and Anders Thorstenson
4
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks
Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen and Matthias Ehrgott
4
Polyhedral Computations for the Simple Graph Partitioning Problem
Michael M. Sørensen
4
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation
Ellis L. Johnson and Sanne Wøhlk
4
The Pyramidal Capacitated Vehicle Routing Problem
Jens Lysgaard
4

Rank papers for other time periods

 

Top 10 Papers by File Downloads Last Month (2017-03)

PaperDownloads
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
3
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 and Diogo Andrade
1
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding
Søren Glud Johansen and Anders Thorstenson
1
A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
Daniele Pretolani, Lars Relund Nielsen and Kim Allan Andersen
1
Reachability cuts for the vehicle routing problem with time windows
Jens Lysgaard
1

Rank papers for other time periods

 

Top 10 Papers by Abstract Accesses Last 3 Months (2017-01 - 2017-03)

PaperDownloads
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand
Christian Larsen
17
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding
Søren Glud Johansen and Anders Thorstenson
15
Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks
Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen and Matthias Ehrgott
14
Note: Comments on the paper by Rosling (2002)
Christian Larsen
14
Column generation approaches to ship scheduling with flexible cargo sizes
Geir Brønmo, Bjørn Nygreen and Jens Lysgaard
14
Comments to Özkaya et al. (2006)
Christian Larsen
13
A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
Daniele Pretolani, Lars Relund Nielsen and Kim Allan Andersen
13
Finding the K shortest hyperpaths using reoptimization
Lars Relund Nielsen, Daniele Pretolani and Kim Allan Andersen
13
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
13
Transportkoncepter og IT-støtte: et undersøgelsesoplæg og nogle foreløbige resultater
Ole Mortensen
12
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 and Anders Thorstenson
12

Rank papers for other time periods

 

Top 10 Papers by File Downloads Last 3 Months (2017-01 - 2017-03)

PaperDownloads
An inventory control project in a major Danish company using compound renewal demand models
Christian Larsen, Claus Hoe Seiding, Christian Teller and Anders Thorstenson
5
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
3
Note: Comments on the paper by Rosling (2002)
Christian Larsen
2
Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang.
Christian Larsen and Gudrun P. Kiesmüller
2
Business integration between manufacturing and transport-logistics firms
Ole Mortensen and Olga W. Lemoine
2
Column generation approaches to ship scheduling with flexible cargo sizes
Geir Brønmo, Bjørn Nygreen and Jens Lysgaard
1
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times
Søren Glud Johansen and Anders Thorstenson
1
A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
Daniele Pretolani, Lars Relund Nielsen and Kim Allan Andersen
1
The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding
Søren Glud Johansen and Anders Thorstenson
1
Scheduling participants of Assessment Centres
Jens Lysgaard and Janni Løber
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 and Diogo Andrade
1
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic
Søren Bloch and Christian H. Christiansen
1
Reachability cuts for the vehicle routing problem with time windows
Jens Lysgaard
1

Rank papers for other time periods

 



Programing by
Design Joakim Ekebom

    This page was generated on 2017-04-01 06:57:50