The following pages link to Lars Relund Nielsen (Q75578):
Displaying 19 items.
- gMOIP (Q75579) (← links)
- A hierarchical Markov decision process modeling feeding and marketing decisions of growing pigs (Q322590) (← links)
- Embedding a state space model into a Markov decision process (Q666503) (← links)
- Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers \& Operations Research 35 (2008) 3714-3726] (Q732917) (← links)
- Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks (Q833580) (← links)
- A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
- An approximate dynamic programming approach for sequential pig marketing decisions at herd level (Q1734355) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- Finding the \(K\) shortest hyperpaths (Q1764762) (← links)
- Optimizing pig marketing decisions under price fluctuations (Q2159547) (← links)
- Finding the \(K\) best policies in a finite-horizon Markov decision process (Q2433472) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- Ranking paths in stochastic time-dependent networks (Q2514742) (← links)
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- The bicriterion multimodal assignment problem: introduction, analysis, and experimental results (Q2901023) (← links)
- Bicriterion Shortest Paths in Stochastic Time-Dependent Networks (Q3649590) (← links)
- Bicriterion shortest hyperpaths in random time-dependent networks (Q4464024) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
