Narrow search
Showing 1 - 6 of 6
Cover Image
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation
Fischer, Vera; Wøhlk, Sanne - In: Computers & operations research : and their … 160 (2023), pp. 1-13
Persistent link: https://www.econbiz.de/10014434486
Cover Image
The time-dependent prize-collecting arc routing problem
Black, Dan; Eglese, Richard; Wøhlk, Sanne - In: Computers & operations research : and their … 40 (2013) 2, pp. 526-535
Persistent link: https://www.econbiz.de/10009661152
Cover Image
A lower bound for the Node, Edge, and Arc Routing Problem
Bach, Lukas; Hasle, Geir; Wøhlk, Sanne - In: Computers & operations research : and their … 40 (2013) 4, pp. 943-952
Persistent link: https://www.econbiz.de/10009719655
Cover Image
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
Wøhlk, Sanne; Laporte, Gilbert - In: Computers & operations research : and their … 87 (2017), pp. 107-113
Persistent link: https://www.econbiz.de/10011743411
Cover Image
Solution of the maximal covering tour problem for locating recycling drop-off stations
Cubillos, Maximiliano; Wøhlk, Sanne - In: Journal of the Operational Research Society 72 (2021) 8, pp. 1898-1913
Persistent link: https://www.econbiz.de/10012609234
Cover Image
A multi-level capacitated arc routing problem with intermediate facilities in waste collection
Wei, Chenge; Wøhlk, Sanne; Che, Ada - In: Computers & operations research : an international journal 167 (2024), pp. 1-14
Persistent link: https://www.econbiz.de/10014566929