Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Lars Relund Nielsen"'
Publikováno v:
INFORMS Journal on Optimization. 5:92-109
This paper presents a new approach to sensitivity analysis of the objective function coefficients in mixed-integer linear programming (MILP). We determine the maximal region of the coefficients for which the current solution remains optimal. The regi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a835b382c1b4caa228fe5316e0102029
https://doi.org/10.1287/ijoo.2022.0078
https://doi.org/10.1287/ijoo.2022.0078
Autor:
Reza Pourmoayed, Lars Relund Nielsen
Publikováno v:
Pourmoayed, R & Relund Nielsen, L 2022, ' Optimizing pig marketing decisions under price fluctuations ', Annals of Operations Research, vol. 314, no. 2, pp. 617-644 . https://doi.org/10.1007/s10479-020-03646-0
In the manufacturing of fattening pigs, pig marketing refers to a sequence of culling decisions until the production unit is empty. The profit of a production unit is highly dependent on the price of pork, the cost of feeding and the cost of buying p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef4b4d2d5d48bd5f5f5049910bb5124e
https://doi.org/10.1007/s10479-020-03646-0
https://doi.org/10.1007/s10479-020-03646-0
Publikováno v:
Forget, N, Gadegaard, S L & Nielsen, L R 2022, ' Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ', European Journal of Operational Research . https://doi.org/10.1016/j.ejor.2022.01.047
Forget, N J, Gadegaard, S L & Relund, L 2022, ' Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ', European Journal of Operational Research, vol. 302, no. 1, pp. 909-924 . https://doi.org/10.1016/j.ejor.2022.01.047
Forget, N J, Gadegaard, S L & Relund, L 2022, ' Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ', European Journal of Operational Research, vol. 302, no. 1, pp. 909-924 . https://doi.org/10.1016/j.ejor.2022.01.047
In this paper we propose a generic branch-and-bound algorithm for solving multi-objective integer linear programming problems. In the recent literature, competitive frameworks has been proposed for bi-objective 0–1 problems, and many of these frame
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::365928d43ceb2b846ab240feac495665
https://pure.au.dk/portal/da/publications/warmstarting-lower-bound-set-computations-for-branchandbound-algorithms-for-multi-objective-integer-linear-programs(f3ef54bc-2df6-447b-9b1e-99db95920bc5).html
https://pure.au.dk/portal/da/publications/warmstarting-lower-bound-set-computations-for-branchandbound-algorithms-for-multi-objective-integer-linear-programs(f3ef54bc-2df6-447b-9b1e-99db95920bc5).html
Autor:
Nicolas Forget, Sune Lauth Gadegaard, Kathrin Klamroth, Lars Relund Nielsen, Anthony Przybylski
Publikováno v:
Forget, N, Gadegaard, S L, Klamroth, K, Nielsen, L R & Przybylski, A 2022, ' Branch-and-bound and objective branching with three or more objectives ', Computers and Operations Research, vol. 148, 106012 . https://doi.org/10.1016/j.cor.2022.106012
The recent success of bi-objective Branch-and-Bound (B&B) algorithms heavily relies on the efficient computation of upper and lower bound sets. These bound sets are used as a supplement to the classical dominance test to improve the computational tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::488941fa568f751abc8a3457e3c5394a
https://doi.org/10.1016/j.cor.2022.106012
https://doi.org/10.1016/j.cor.2022.106012
Publikováno v:
Gadegaard, S L, Nielsen, L R & Ehrgott, M 2019, ' Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets ', INFORMS Journal on Computing, vol. 31, no. 4, pp. 790-804 . https://doi.org/10.1287/ijoc.2018.0846
Most real-world optimization problems are multi-objective by nature, with conflicting and incomparable objectives. Solving a multi-objective optimization problem requires a method that can generate all rational compromises between the objectives. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::160bc353e6577f9ae8326c40d31daa25
https://pure.au.dk/portal/da/publications/biobjective-branchandcut-algorithms-based-on-lp-relaxation-and-bound-sets(51864a7e-5567-4488-baa5-1eab0296413a).html
https://pure.au.dk/portal/da/publications/biobjective-branchandcut-algorithms-based-on-lp-relaxation-and-bound-sets(51864a7e-5567-4488-baa5-1eab0296413a).html
Autor:
Reza Pourmoayed, Lars Relund Nielsen
Publikováno v:
Pourmoayed, R & Nielsen, L R 2019, ' An approximate dynamic programming approach for sequential pig marketing decisions at herd level ', European Journal of Operational Research, vol. 276, no. 3, pp. 1056-1070 . https://doi.org/10.1016/j.ejor.2019.01.050
One of the most important operations in the production of growing/finishing pigs is the marketing of pigs for slaughter. While pork production can be managed at different levels (animal, pen, section, or herd), it is beneficial to consider the herd l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::336914d689061b5297caf014a27a9499
https://pure.au.dk/portal/da/publications/an-approximate-dynamic-programming-approach-for-sequential-pig-marketing-decisions-at-herd-level(d5d0ac61-16f9-441e-9d23-6e515c708085).html
https://pure.au.dk/portal/da/publications/an-approximate-dynamic-programming-approach-for-sequential-pig-marketing-decisions-at-herd-level(d5d0ac61-16f9-441e-9d23-6e515c708085).html
Publikováno v:
Gadegaard, S L, Klose, A & Nielsen, L R 2018, ' A bi-objective approach to discrete cost-bottleneck location problems ', Annals of Operations Research, vol. 267, no. 1-2, pp. 179-201 . https://doi.org/10.1007/s10479-016-2360-8
This paper considers a family of bi-objective discrete facility location problems with a cost objective and a bottleneck objective. A special case is, for instance, a bi-objective version of the (vertex) p-centdian problem. We show that bi-objective
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fad93a724acfbe15487b3af9e86a92ff
https://pure.au.dk/ws/files/165164872/Gadegaard_2018_A_bi_objective_approach_to_discrete_cost_bottleneck_location.pdf
https://pure.au.dk/ws/files/165164872/Gadegaard_2018_A_bi_objective_approach_to_discrete_cost_bottleneck_location.pdf
Publikováno v:
Nielsen, L R, Jørgensen, E & Højsgaard, S 2011, ' Embedding a State Space Model Into a Markov Decision Process ', Annals of Operations Research, vol. 190, no. 1, pp. 289-309 . https://doi.org/10.1007/s10479-010-0688-z
In agriculture Markov decision processes (MDPs) with finite state and action space are often used to model sequential decision making over time. For instance, states in the process represent possible levels of traits of the animal and transition prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97eeb820413b32fdd8a37ab311b0b5fa
https://doi.org/10.1007/s10479-010-0688-z
https://doi.org/10.1007/s10479-010-0688-z
Publikováno v:
Pretolani, D, Nielsen, L R, Andersen, K A & Ehrgott, M 2009, ' Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks ', Operations Research Letters, vol. 37, no. 3, pp. 201-205 . https://doi.org/10.1016/j.orl.2009.02.001
We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' model and the more flexible "history-adaptive'' one. We point out several properties of the sets of efficient solutions fou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20ab71ae631bd5b33cc4126746d0f295
https://doi.org/10.1016/j.orl.2009.02.001
https://doi.org/10.1016/j.orl.2009.02.001
Publikováno v:
International Series in Operations Research & Management Science ISBN: 9781493924820
University of Copenhagen
Nielsen, L R & Kristensen, A R 2015, Markov decision processes to model livestock systems . in L M Plà-Aragonés (ed.), Handbook of Operations Research in Agriculture and the Agri-Food Industry . Springer, New York, International Series in Operations Research and Management Science, vol. 224, pp. 419-454 . https://doi.org/10.1007/978-1-4939-2483-7_19
University of Copenhagen
Nielsen, L R & Kristensen, A R 2015, Markov decision processes to model livestock systems . in L M Plà-Aragonés (ed.), Handbook of Operations Research in Agriculture and the Agri-Food Industry . Springer, New York, International Series in Operations Research and Management Science, vol. 224, pp. 419-454 . https://doi.org/10.1007/978-1-4939-2483-7_19
Livestock farming problems are often sequential in nature. For instance at a specific time instance the decision on whether to replace an animal or not is based on known information and expectation about the future. At the next decision epoch updated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb0c1f16bfe2601c96618be7f93ecaae
https://doi.org/10.1007/978-1-4939-2483-7_19
https://doi.org/10.1007/978-1-4939-2483-7_19