Sanne Wøhlk

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 17

Top Topics

Benders Decomposition

Waste Collection

Routing Problem

Greedy Algorithms

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

EURO J. Transp. Logist.

J. Oper. Res. Soc.

Publications

Chenge Wei, Sanne Wøhlk, Ada Che
A multi-level capacitated arc routing problem with intermediate facilities in waste collection. Comput. Oper. Res. 167 (2024)
José M. Belenguer, Maximiliano Cubillos, Sanne Wøhlk
A branch-and-cut algorithm for a skip pick-up and delivery problem. Comput. Oper. Res. 168 (2024)
Vera Fischer, Sanne Wøhlk
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation. Comput. Oper. Res. 160 (2023)
Sanne Wøhlk, Gilbert Laporte
Transport of skips between recycling centers and treatment facilities. Comput. Oper. Res. 145 (2022)
Shohre Zehtabian, Christian Larsen, Sanne Wøhlk
Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting. Eur. J. Oper. Res. 303 (2) (2022)
Maximiliano Cubillos, Sanne Wøhlk, Jesper N. Wulff
A bi-objective k-nearest-neighbors-based imputation method for multilevel data. Expert Syst. Appl. 204 (2022)
Maximiliano Cubillos, Remy Spliet, Sanne Wøhlk
On the effect of using sensors and dynamic forecasts in inventory-routing problems. INFOR Inf. Syst. Oper. Res. 60 (4) (2022)
Maximiliano Cubillos, Sanne Wøhlk
Solution of the maximal covering tour problem for locating recycling drop-off stations. J. Oper. Res. Soc. 72 (8) (2021)
Sanne Wøhlk, Gilbert Laporte
A districting-based heuristic for the coordinated capacitated arc routing problem. Comput. Oper. Res. 111 (2019)
Samira Mirzaei, Sanne Wøhlk
A Branch-and-Price algorithm for two multi-compartment vehicle routing problems. EURO J. Transp. Logist. 8 (1) (2019)
Sanne Wøhlk, Gilbert Laporte
A fast heuristic for large-scale capacitated arc routing problems. J. Oper. Res. Soc. 69 (12) (2018)
Lone Kiilerich, Sanne Wøhlk
New large-scale data instances for CARP and new variations of CARP. INFOR Inf. Syst. Oper. Res. 56 (1) (2018)
Sanne Wøhlk, Gilbert Laporte
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs. Comput. Oper. Res. 87 (2017)
Samira Mirzaei, Sanne Wøhlk
Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems. EURO J. Transp. Logist. 6 (2) (2017)
Lukas Bach, Jens Lysgaard, Sanne Wøhlk
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem. Networks 68 (3) (2016)
Maria Elbek, Sanne Wøhlk
A variable neighborhood search for the multi-period collection of recyclable materials. Eur. J. Oper. Res. 249 (2) (2016)
Lukas Bach, Michel Gendreau, Sanne Wøhlk
Freight railway operator timetabling and engine scheduling. Eur. J. Oper. Res. 241 (2) (2015)
Jens Lysgaard, Sanne Wøhlk
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. Eur. J. Oper. Res. 236 (3) (2014)
Dan Black, Richard W. Eglese, Sanne Wøhlk
The time-dependent prize-collecting arc routing problem. Comput. Oper. Res. 40 (2) (2013)
Lukas Bach, Geir Hasle, Sanne Wøhlk
A lower bound for the Node, Edge, and Arc Routing Problem. Comput. Oper. Res. 40 (4) (2013)
Kim S. Larsen, Sanne Wøhlk
Competitive analysis of the online inventory problem. Eur. J. Oper. Res. 207 (2) (2010)
Christian H. Christiansen, Jens Lysgaard, Sanne Wøhlk
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands. Oper. Res. Lett. 37 (6) (2009)
Sanne Wøhlk
New lower bound for the Capacitated Arc Routing Problem. Comput. Oper. Res. 33 (12) (2006)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
The maximum resource bin packing problem. Theor. Comput. Sci. 362 (1-3) (2006)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
The Maximum Resource Bin Packing Problem. FCT (2005)