S-WoPEc
 
Scandinavian Working Papers in Economics
HomeAboutSeriesSubject/JEL codesAdvanced 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 S-WoBA

Number of downloads from S-WoBA

Fulltext files and Additional files (supplementary files) are files downloaded from the S-WoBA 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 S-WoBA

Number of papers at S-WoBA

The raw data

 

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

PaperAccesses
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
8
The Pyramidal Capacitated Vehicle Routing Problem
Jens Lysgaard
8
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
6
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
5
A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
Daniele Pretolani, Lars Relund Nielsen and Kim Allan Andersen
4
Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand
Christian Larsen
4
Column generation approaches to ship scheduling with flexible cargo sizes
Geir Brønmo, Bjørn Nygreen and Jens Lysgaard
4
Bicriterion a priori route choice in stochastic time-dependent networks.
Lars Relund Nielsen, Kim Allan Andersen and Daniele Pretolani
4
Business integration between manufacturing and transport-logistics firms
Ole Mortensen and Olga W. Lemoine
4
The Q(s,S) control policy for the joint replenishment problem extended to the case of correlation among item-demands
Christian Larsen
4
Finding the K shortest hyperpaths using reoptimization
Lars Relund Nielsen, Daniele Pretolani and Kim Allan Andersen
4
Transportkoncepter og IT-støtte: et undersøgelsesoplæg og nogle foreløbige resultater
Ole Mortensen
4
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
4
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times
Søren Glud Johansen and Anders Thorstenson
4
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic
Søren Bloch and Christian H. Christiansen
4
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
4

Rank papers for other time periods

 

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

PaperDownloads
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
2
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic
Søren Bloch and Christian H. Christiansen
1
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
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-09 - 2017-11)

PaperDownloads
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
25
Column generation approaches to ship scheduling with flexible cargo sizes
Geir Brønmo, Bjørn Nygreen and Jens Lysgaard
24
The Pyramidal Capacitated Vehicle Routing Problem
Jens Lysgaard
23
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
18
Transportkoncepter og IT-støtte: et undersøgelsesoplæg og nogle foreløbige resultater
Ole Mortensen
17
Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times
Søren Glud Johansen and Anders Thorstenson
17
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
17
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
17
Finding the K shortest hyperpaths using reoptimization
Lars Relund Nielsen, Daniele Pretolani and Kim Allan Andersen
17
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation
Ellis L. Johnson and Sanne Wøhlk
16

Rank papers for other time periods

 

Top 10 Papers by File Downloads Last 3 Months (2017-09 - 2017-11)

PaperDownloads
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford, Jens Lysgaard and Richard W. Eglese
2
The Pyramidal Capacitated Vehicle Routing Problem
Jens Lysgaard
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 and Anders Thorstenson
2
Reachability cuts for the vehicle routing problem with time windows
Jens Lysgaard
1
Bicriterion a priori route choice in stochastic time-dependent networks.
Lars Relund Nielsen, Kim Allan Andersen and Daniele Pretolani
1
K shortest paths in stochastic time-dependent networks
Lars Relund Nielsen, Daniele Pretolani and Kim Allan Andersen
1
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
1
Simultaneously Optimizing Storage Location Assignment at Forward Area and Reserve Area - a Decomposition Based Heuristic
Søren Bloch and Christian H. Christiansen
1
Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation
Ellis L. Johnson and Sanne Wøhlk
1

Rank papers for other time periods

 



Programing by
Design by Joakim Ekebom

    This page was generated on 2017-12-01 06:54:46