Narrow search
Showing 1 - 7 of 7
Cover Image
A simple, efficient and versatile objective space algorithm for multiobjective integer programming
Dächert, Kerstin; Fleuren, Tino; Klamroth, Kathrin - 2024
Persistent link: https://www.econbiz.de/10015126905
Cover Image
Multicriteria 0-1 knapsack problems with k-min objectives
Rong, Aiying; Klamroth, Kathrin; Figueira, José Rui - In: Computers & operations research : and their … 40 (2013) 5, pp. 1481-1496
Persistent link: https://www.econbiz.de/10009735871
Cover Image
The multi-facility location-allocation problem with polyhedral barriers
Bischoff, Martin; Fleischmann, Tina; Klamroth, Kathrin - In: Computers & operations research : and their … 36 (2009) 5, pp. 1376-1392
Persistent link: https://www.econbiz.de/10003827822
Cover Image
Bi-dimensional knapsack problems with one soft constraint
Schulze, Britta; Paquete, Luís F.; Klamroth, Kathrin; … - In: Computers & operations research : and their … 78 (2017), pp. 15-26
Persistent link: https://www.econbiz.de/10011630990
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
A unified model for Weber problems with continuous and network distances
Pfeiffer, B.; Klamroth, Kathrin - In: Computers & operations research : and their … 35 (2008) 2, pp. 312-326
Persistent link: https://www.econbiz.de/10003668311
Cover Image
Greedy algorithms for a class of knapsack problems with binary weights
Gorski, Jochen; Paquete, Luís F.; Pedrosa, Fábio - In: Computers & operations research : and their … 39 (2012) 3, pp. 498-511
Persistent link: https://www.econbiz.de/10009384621