Sanne Wøhlk

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