![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Lars Relund Nielsen
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j18]Kim Allan Andersen, Trine Krogh Boomsma
, Lars Relund Nielsen
:
MILP Sensitivity Analysis for the Objective Function Coefficients. INFORMS J. Optim. 5(1): 92-109 (2023) - 2022
- [j17]Reza Pourmoayed
, Lars Relund Nielsen
:
Optimizing pig marketing decisions under price fluctuations. Ann. Oper. Res. 314(2): 617-644 (2022) - [j16]Nicolas Forget
, Sune Lauth Gadegaard
, Kathrin Klamroth
, Lars Relund Nielsen
, Anthony Przybylski:
Branch-and-bound and objective branching with three or more objectives. Comput. Oper. Res. 148: 106012 (2022) - [j15]Nicolas Forget
, Sune Lauth Gadegaard
, Lars Relund Nielsen
:
Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. Eur. J. Oper. Res. 302(3): 909-924 (2022)
2010 – 2019
- 2019
- [j14]Reza Pourmoayed
, Lars Relund Nielsen
:
An approximate dynamic programming approach for sequential pig marketing decisions at herd level. Eur. J. Oper. Res. 276(3): 1056-1070 (2019) - [j13]Sune Lauth Gadegaard
, Lars Relund Nielsen
, Matthias Ehrgott
:
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets. INFORMS J. Comput. 31(4): 790-804 (2019) - 2018
- [j12]Sune Lauth Gadegaard
, Andreas Klose
, Lars Relund Nielsen
:
A bi-objective approach to discrete cost-bottleneck location problems. Ann. Oper. Res. 267(1-2): 179-201 (2018) - [j11]Sune Lauth Gadegaard
, Andreas Klose
, Lars Relund Nielsen
:
An improved cut-and-solve algorithm for the single-source capacitated facility location problem. EURO J. Comput. Optim. 6(1): 1-27 (2018) - 2016
- [j10]Reza Pourmoayed
, Lars Relund Nielsen
, Anders Ringgaard Kristensen
:
A hierarchical Markov decision process modeling feeding and marketing decisions of growing pigs. Eur. J. Oper. Res. 250(3): 925-938 (2016) - 2014
- [j9]Lars Relund Nielsen
, Kim Allan Andersen, Daniele Pretolani:
Ranking paths in stochastic time-dependent networks. Eur. J. Oper. Res. 236(3): 903-914 (2014) - 2011
- [j8]Lars Relund Nielsen
, Erik Jørgensen
, Søren Højsgaard
:
Embedding a state space model into a Markov decision process. Ann. Oper. Res. 190(1): 289-309 (2011) - 2010
- [j7]Christian Roed Pedersen, Lars Relund Nielsen
, Kim Allan Andersen:
Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726]. Comput. Oper. Res. 37(2): 426-427 (2010)
2000 – 2009
- 2009
- [j6]Daniele Pretolani, Lars Relund Nielsen
, Kim Allan Andersen, Matthias Ehrgott
:
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. Oper. Res. Lett. 37(3): 201-205 (2009) - 2008
- [j5]Christian Roed Pedersen, Lars Relund Nielsen
, Kim Allan Andersen:
An algorithm for ranking assignments using reoptimization. Comput. Oper. Res. 35(11): 3714-3726 (2008) - [j4]Christian Roed Pedersen, Lars Relund Nielsen
, Kim Allan Andersen:
The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results. INFORMS J. Comput. 20(3): 400-411 (2008) - 2006
- [j3]Lars Relund Nielsen
, Anders Ringgaard Kristensen
:
Finding the K best policies in a finite-horizon Markov decision process. Eur. J. Oper. Res. 175(2): 1164-1179 (2006) - [j2]Lars Relund Nielsen
, Daniele Pretolani, Kim Allan Andersen:
Finding the K shortest hyperpaths using reoptimization. Oper. Res. Lett. 34(2): 155-164 (2006) - 2005
- [j1]Lars Relund Nielsen
, Kim Allan Andersen, Daniele Pretolani:
Finding the K shortest hyperpaths. Comput. Oper. Res. 32: 1477-1497 (2005)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint