Refereed work

An improved cut-and-solve algorithm for the single-source capacitated facility location problem

S.L. Gadegaard and A. Klose and L.R. Nielsen
EURO Journal on Computational Optimization, 1-27 (2017)
[abstract | pdf | doi | bibtex]

A bi-objective approach to discrete cost-bottleneck location problems

S.L. Gadegaard and A Klose and L.R. Nielsen
Annals of Operations Research, 1-23 (2016)
[abstract | pdf | doi | bibtex]

A hierarchical Markov decision process modeling feeding and marketing decisions of growing pigs

Pourmoayed, Reza and Nielsen, Lars Relund and Kristensen, Anders Ringgaard
European Journal of Operational Research, 250 (3), 925-938 (2016)
[abstract | pdf | doi | bibtex]

Markov decision processes to model livestock systems

Nielsen, L.R. and Kristensen, A.R.
In book "Handbook of Operations Research in Agriculture and the Agri-Food Industry" , 224, 419-454 (2015)
Series: International Series in Operations Research & Management Science
[abstract | pdf | doi | bibtex]

Ranking paths in stochastic time-dependent networks

L.R. Nielsen and K.A. Andersen and D. Pretolani
European Journal of Operational Research, 236 (3), 903-914 (2014)
[abstract | pdf | doi | bibtex]

Inventory control in a lost-sales setting with information about supply lead times

Abhijit Bhagwan Bendre and Lars Relund Nielsen
International Journal of Production Economics, 142 (2), 324-331 (2013)
[abstract | pdf | doi | bibtex]

Embedding a state space model into a Markov decision process

L.R Nielsen and E. Jørgensen and S. Højsgaard
Annals of Operations Research, 190 (1), 289-309 (2011)
[abstract | pdf | doi | bibtex]

Optimal Replacement Policies for Dairy Cows Based on Daily Yield Measurements

L.R Nielsen and E. Jørgensen and A.R. Kristensen and S. Østergaard
Journal of Dairy Science, 93 (1), 77-92 (2010)
[abstract | pdf | doi | bibtex]

Quantifying walking and standing behaviour of dairy cows using a moving average based on output from an accelerometer

L.R Nielsen and A.R. Pedersen and M.S. Herskin and L. Munksgaard
Applied Animal Behaviour Science, 127 (1-2), 12-19 (2010)
[abstract | pdf | doi | bibtex]

Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers and Operations Research 35 (2008) 3714-3726]

Pedersen, C.R. and Nielsen, L.R. and Andersen, K.A.
Computers and Operations Research, 37, 426-427 (2010)
[abstract | pdf | doi | bibtex]

Bicriterion shortest paths in stochastic time-dependent networks

L.R. Nielsen and D. Pretolani and K.A. Andersen
In book "Multiobjective Programming and Goal Programming" , 618, 57-67 (2009)
Series: Lecture Notes in Economics and Mathematical Systems
[abstract | pdf | doi | bibtex]

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

D. Pretolani and L.R. Nielsen and K.A. Andersen and M. Ehrgott
Operations Research Letters, 37 (3), 201-205 (2009)
[abstract | pdf | doi | bibtex]

The Bicriterion Multi Modal Assignment Problem: Introduction, Analysis, and Experimental Results

Pedersen, C.R. and Nielsen, L.R. and Andersen, K.A.
Informs Journal on Computing, 20 (3), 400–411 (2008)
[abstract | pdf | doi | bibtex]

An algorithm for ranking assignments using reoptimization

Pedersen, C.R. and Nielsen, L.R. and Andersen, K.A.
Computers and Operations Research, 35 (11), 3714-3726 (2008)
A working paper have also been written. However, using another implementation.
[abstract | pdf | doi | bibtex]

Finding the $K$ best policies in a finite-horizon Markov decision process

Nielsen, L.R. and Kristensen, A.R.
European Journal of Operational Research, 175 (2), 1164–1179 (2006)
[abstract | pdf | doi | bibtex]

Finding the $K$ shortest hyperpaths using reoptimization

L.R. Nielsen and D. Pretolani and K.A. Andersen
Operations Research Letters, 34 (2), 155–164 (2006)
An earlier version with fewer figures is listed under technical reports.
[abstract | pdf | doi | bibtex]

Finding the $K$ Shortest Hyperpaths

L.R. Nielsen and K.A. Andersen and D. Pretolani
Computers and Operations Research, 32 (6), 1477–1497 (2005)
An earlier different version with more computational results is listed under technical reports.
[abstract | pdf | doi | bibtex]

Route Choice in Stochastic Time-Dependent Networks

L.R. Nielsen
Department of Operations Research, University of Aarhus (2003)
Ph.D. thesis
[abstract | pdf | bibtex]

Bicriterion Shortest Hyperpaths in Random Time-Dependent Networks

L.R. Nielsen and K.A. Andersen and D. Pretolani
IMA Journal of Management Mathematics, 14 (3), 271–303 (2003)
An earlier version with more computational results is listed under technical reports.
[abstract | pdf | doi | bibtex]

Technical Reports

Bi-objective branch-and-cut algorithms: Applications to the single source capacitated facility location problem

S.L. Gadegaard and M. Ehrgott and L.R. Nielsen
Optimization Online (2016)
[abstract | pdf | bibtex]

An overview over pig production of fattening pigs with a focus on possible decisions in the production chain

Pourmoayed, R. and Nielsen, L.R.
Aarhus University, PigIT Report No. 4 (2014)
[abstract | pdf | bibtex]

Udredningsrapport om økonomisk foderoptimering i den enkelte besætning baseret på NorFor Plan

S. Østergaard and M. Weisbjerg and O. Aaes and N. Friggens and T. Kristensen and A.R. Kristensen and L.R. Nielsen and D. Bossen
Det Jordbrugsvidenskabelige Fakultet, Aarhus Universitet, DJF husdyrbrug 14 (2009)
[abstract | pdf | bibtex]

Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks

D. Pretolani and L.R. Nielsen and K.A. Andersen and M. Ehrgott
Department of Business Studies, Aarhus School of Business, L-2008-05 (2008)
[abstract | pdf | bibtex]

Bicriterion a priori route choice in stochastic time-dependent networks

L.R. Nielsen and D. Pretolani and K.A. Andersen
Department of Business Studies, Aarhus School of Business, WP-L-2006-10 (2006)
[abstract | pdf | bibtex]

A note on "Multicriteria adaptive paths in stochastic, time-varying networks"

D. Pretolani and L.R. Nielsen and K.A. Andersen
Department of Business Studies, Aarhus School of Business, L-2006-11 (2006)
[abstract | pdf | bibtex]

Risk Management in Forestry - Possible Solution Approaches

Nielsen, L.R. and Kristensen, A.R.
Danish Informatics Network in the Agriculture Sciences (DINA), The Royal Veterinary and Agricultural University, DINA Notat No. 111 (2005)
[abstract | pdf | bibtex]

On the Bicriterion Multi Modal Assignment Problem

Pedersen, C.R. and Nielsen, L.R. and Andersen, K.A.
Department of Operations Research, University of Aarhus, WP-2005-3 (2005)
[abstract | pdf | bibtex]

A note on ranking assignments using reoptimization

Pedersen, C.R. and Nielsen, L.R. and Andersen, K.A.
Department of Operations Research, University of Aarhus, WP-2005-2 (2005)
An article with a better implementation is shown under 'Refereed Work'
[abstract | pdf | bibtex]

Finding the $K$ best policies in finite-horizon Markov decision processes

Nielsen, L.R. and Kristensen, A.R.
Danish Informatics Network in the Agriculture Sciences (DINA), The Royal Veterinary and Agricultural University, DINA Research Report No. 110 (2004)
[abstract | pdf | bibtex]

Risk aversion in Markov decision processes

L.R. Nielsen and A.R. Kristensen
Proceedings of the European Workshop for Decision Problems in Agriculture and Natural Resources (EWDA-04)
Silsoe Research Institute, Silsoe, England, 27-28 September (2004)
[abstract | pdf | slides | bibtex]

$K$ shortest paths in stochastic time-dependent networks

L.R. Nielsen and D. Pretolani and K.A. Andersen
Department of Accounting, Finance and Logistics, Aarhus School of Business, WP-L-2004-05 (2004)
[abstract | pdf | bibtex]

Finding the $K$ shortest hyperpaths using reoptimization

L.R. Nielsen and D. Pretolani and K.A. Andersen
Department of Accounting, Finance and Logistics, Aarhus School of Business, WP-L-2004-04 (2004)
A published version with more figures is listed under refereed work.
[abstract | pdf | bibtex]

Bicriterion Shortest Hyperpaths in Random Time-Dependent Networks

L.R. Nielsen and K.A. Andersen and D. Pretolani
Department of Operations Research, University of Aarhus, WP-2003-1 (2003)
A published version with fewer computational results is listed under refereed work.
[abstract | pdf | bibtex]

Finding the $K$ Shortest Hyperpaths: algorithms and applications

L.R. Nielsen and K.A. Andersen and D. Pretolani
Department of Operations Research, University of Aarhus, WP-2002-2 (2002)
A published version with fewer computational results is listed under refereed work.
[abstract | pdf | bibtex]

A Remark on the Definition of a B-Hyperpath

L.R. Nielsen and D. Pretolani
Department of Operations Research, University of Aarhus (2001)
[abstract | pdf | bibtex]

A Bicriterion and Parametric Analysis of the Shortest Hyperpath Problem

Lars Relund Nielsen
Department of Operations Research, University of Aarhus (2001)
Master thesis
[abstract | pdf | bibtex]

The Facets of the Set Packing Polytope: A Logical Interpretation

Kim A. Andersen and Lars R. Nielsen and Morten Riis and Anders J. V. Skriver
Department of Operations Research, University of Aarhus, WP-2000-3 (2000)
[abstract | pdf | bibtex]

Other publications

Culling pigs under price fluctuations

Pourmoayed, Reza and Nielsen, Lars Relund
OrBit, 27, 26-31 (2016)
[abstract | pdf | bibtex]

TEGP - Time-Expanded Generator with Peaks (v1.66)

L.R. Nielsen
(2013)
[abstract | pdf | bibtex]

Det optimale udskiftningstidspunkt for en malkeko

L.R. Nielsen and E. Jørgensen
OrBit, 17, 14-16 (2010)
Populærvidenskabelig artikel
[abstract | pdf | bibtex]

Koens økonomiske værdi

L.R. Nielsen and S. Højsgaard
Ny KvægForskning, 5, 8-9 (2009)
Populærvidenskabelig artikel
[abstract | pdf | bibtex]

TEGP - Time-Expanded Generator with Peaks (v1.5)

L.R. Nielsen
(2006)
[abstract | pdf | bibtex]

APGen - an assignment problem generator

L.R. Nielsen and C.R. Pedersen
(2005)
[abstract | pdf | bibtex]

The papers distributed here have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.