Sanne Wøhlk

According to our database, Sanne Wøhlk authored at least 22 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation.

Vera Fischer, Sanne Wøhlk

Comput. Oper. Res., December, 2023

2022

On the effect of using sensors and dynamic forecasts in inventory-routing problems.

Maximiliano Cubillos, Remy Spliet, Sanne Wøhlk

INFOR Inf. Syst. Oper. Res., 2022

A bi-objective k-nearest-neighbors-based imputation method for multilevel data.

Maximiliano Cubillos, Sanne Wøhlk, Jesper N. Wulff

Expert Syst. Appl., 2022

Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting.

Shohre Zehtabian, Christian Larsen, Sanne Wøhlk

Eur. J. Oper. Res., 2022

Transport of skips between recycling centers and treatment facilities.

Sanne Wøhlk, Gilbert Laporte

Comput. Oper. Res., 2022

2021

Solution of the maximal covering tour problem for locating recycling drop-off stations.

Maximiliano Cubillos, Sanne Wøhlk

J. Oper. Res. Soc., 2021

2019

A Branch-and-Price algorithm for two multi-compartment vehicle routing problems.

Samira Mirzaei, Sanne Wøhlk

EURO J. Transp. Logist., 2019

A districting-based heuristic for the coordinated capacitated arc routing problem.

Sanne Wøhlk, Gilbert Laporte

Comput. Oper. Res., 2019

2018

A fast heuristic for large-scale capacitated arc routing problems.

Sanne Wøhlk, Gilbert Laporte

J. Oper. Res. Soc., 2018

New large-scale data instances for CARP and new variations of CARP.

Lone Kiilerich, Sanne Wøhlk

INFOR Inf. Syst. Oper. Res., 2018

2017

Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems.

Samira Mirzaei, Sanne Wøhlk

EURO J. Transp. Logist., 2017

Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs.

Sanne Wøhlk, Gilbert Laporte

Comput. Oper. Res., 2017

2016

A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem.

Lukas Bach, Jens Lysgaard, Sanne Wøhlk

Networks, 2016

A variable neighborhood search for the multi-period collection of recyclable materials.

Maria Elbek, Sanne Wøhlk

Eur. J. Oper. Res., 2016

2015

Freight railway operator timetabling and engine scheduling.

Lukas Bach, Michel Gendreau, Sanne Wøhlk

Eur. J. Oper. Res., 2015

2014

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem.

Jens Lysgaard, Sanne Wøhlk

Eur. J. Oper. Res., 2014

2013

The time-dependent prize-collecting arc routing problem.

Dan Black, Richard W. Eglese, Sanne Wøhlk

Comput. Oper. Res., 2013

A lower bound for the Node, Edge, and Arc Routing Problem.

Lukas Bach, Geir Hasle, Sanne Wøhlk

Comput. Oper. Res., 2013

2010

Competitive analysis of the online inventory problem.

Kim S. Larsen, Sanne Wøhlk

Eur. J. Oper. Res., 2010

2009

A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands.

Christian H. Christiansen, Jens Lysgaard, Sanne Wøhlk

Oper. Res. Lett., 2009

2006

The maximum resource bin packing problem.

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk

Theor. Comput. Sci., 2006

New lower bound for the Capacitated Arc Routing Problem.

Sanne Wøhlk

Comput. Oper. Res., 2006