Narrow search
Showing 1 - 10 of 11
Cover Image
MILP sensitivity analysis for the objective function coefficients
Andersen, Kim Allan; Boomsma, Trine Krogh; Nielsen, … - In: INFORMS journal on optimization 5 (2023) 1, pp. 92-109
Persistent link: https://www.econbiz.de/10014292042
Cover Image
An approximate dynamic programming approach for sequential pig marketing decisions at herd level
Pourmoayed, Reza; Nielsen, Lars Relund - In: European journal of operational research : EJOR 276 (2019) 3, pp. 1056-1070
Persistent link: https://www.econbiz.de/10012003710
Cover Image
A bi-objective approach to discrete cost-bottleneck location problems
Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund - In: Managerial multiple objective optimization, (pp. 179-201). 2018
Persistent link: https://www.econbiz.de/10011897007
Cover Image
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Gadegaard, Sune Lauth; Nielsen, Lars Relund; Ehrgott, … - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 790-804
Persistent link: https://www.econbiz.de/10012125747
Cover Image
An improved cut-and-solve algorithm for the single-source capacitated facility location problem
Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund - In: EURO journal on computational optimization 6 (2018) 1, pp. 1-27
Persistent link: https://www.econbiz.de/10011964457
Cover Image
Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
Forget, Nicolas; Gadegaard, Sune Lauth; Nielsen, Lars Relund - In: European journal of operational research : EJOR 302 (2022) 3, pp. 909-924
Persistent link: https://www.econbiz.de/10013363797
Cover Image
Branch-and-bound and objective branching with three or more objectives
Forget, Nicolas; Gadegaard, Sune Lauth; Klamroth, Kathrin; … - In: Computers & operations research : and their … 148 (2022), pp. 1-16
Persistent link: https://www.econbiz.de/10013483596
Cover Image
Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs
Andersen, Kim Allan; Lind, Mikael - In: International journal of game theory : official journal … 28 (1999) 4, pp. 585-597
Persistent link: https://www.econbiz.de/10001434013
Cover Image
Solving the single-sink, fixed-charge, multiple-choice transportation problem by dynamic programming
Christensen, Tue R. L.; Andersen, Kim Allan; Klose, Andreas - In: Transportation science : a journal of the Institute for … 47 (2013) 3, pp. 428-438
Persistent link: https://www.econbiz.de/10009789429
Cover Image
A branch and bound algorithm for a class of biobjective mixed integer programs
Stidsen, Thomas; Andersen, Kim Allan; Dammann, Bernd - In: Management science : journal of the Institute for … 60 (2014) 4, pp. 1009-1032
Persistent link: https://www.econbiz.de/10010347789