Lars Relund Nielsen

According to our database, Lars Relund Nielsen authored at least 18 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

MILP Sensitivity Analysis for the Objective Function Coefficients.

Kim Allan Andersen, Trine Krogh Boomsma, Lars Relund Nielsen

INFORMS J. Optim., January, 2023

2022

Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs.

Nicolas Forget, Sune Lauth Gadegaard, Lars Relund Nielsen

Eur. J. Oper. Res., 2022

Branch-and-bound and objective branching with three or more objectives.

Nicolas Forget, Sune Lauth Gadegaard, Kathrin Klamroth, Lars Relund Nielsen, Anthony Przybylski

Comput. Oper. Res., 2022

Optimizing pig marketing decisions under price fluctuations.

Reza Pourmoayed, Lars Relund Nielsen

Ann. Oper. Res., 2022

2019

Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets.

Sune Lauth Gadegaard, Lars Relund Nielsen, Matthias Ehrgott

INFORMS J. Comput., 2019

An approximate dynamic programming approach for sequential pig marketing decisions at herd level.

Reza Pourmoayed, Lars Relund Nielsen

Eur. J. Oper. Res., 2019

2018

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

Sune Lauth Gadegaard, Andreas Klose, Lars Relund Nielsen

EURO J. Comput. Optim., 2018

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

Sune Lauth Gadegaard, Andreas Klose, Lars Relund Nielsen

Ann. Oper. Res., 2018

2016

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

Reza Pourmoayed, Lars Relund Nielsen, Anders Ringgaard Kristensen

Eur. J. Oper. Res., 2016

2014

Ranking paths in stochastic time-dependent networks.

Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani

Eur. J. Oper. Res., 2014

2011

Embedding a state space model into a Markov decision process.

Lars Relund Nielsen, Erik Jørgensen, Søren Højsgaard

Ann. Oper. Res., 2011

2010

Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726].

Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen

Comput. Oper. Res., 2010

2009

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

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott

Oper. Res. Lett., 2009

2008

The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results.

Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen

INFORMS J. Comput., 2008

An algorithm for ranking assignments using reoptimization.

Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen

Comput. Oper. Res., 2008

2006

Finding the <i>K</i> shortest hyperpaths using reoptimization.

Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen

Oper. Res. Lett., 2006

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

Lars Relund Nielsen, Anders Ringgaard Kristensen

Eur. J. Oper. Res., 2006

2005

Finding the <i>K</i> shortest hyperpaths.

Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani

Comput. Oper. Res., 2005