default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanne Wøhlk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Chenge Wei, Sanne Wøhlk
, Ada Che:
A multi-level capacitated arc routing problem with intermediate facilities in waste collection. Comput. Oper. Res. 167: 106671 (2024)- [j23]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: 106705 (2024) - 2023
- [j22]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: 106393 (2023) - 2022
- [j21]Sanne Wøhlk, Gilbert Laporte:
Transport of skips between recycling centers and treatment facilities. Comput. Oper. Res. 145: 105879 (2022) - [j20]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): 616-632 (2022) - [j19]Maximiliano Cubillos, Sanne Wøhlk, Jesper N. Wulff:
A bi-objective k-nearest-neighbors-based imputation method for multilevel data. Expert Syst. Appl. 204: 117298 (2022) - [j18]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): 473-490 (2022) - 2021
- [j17]Maximiliano Cubillos, Sanne Wøhlk:
Solution of the maximal covering tour problem for locating recycling drop-off stations. J. Oper. Res. Soc. 72(8): 1898-1913 (2021)
2010 – 2019
- 2019
- [j16]Sanne Wøhlk, Gilbert Laporte:
A districting-based heuristic for the coordinated capacitated arc routing problem. Comput. Oper. Res. 111: 271-284 (2019) - [j15]Samira Mirzaei, Sanne Wøhlk:
A Branch-and-Price algorithm for two multi-compartment vehicle routing problems. EURO J. Transp. Logist. 8(1): 1-33 (2019) - 2018
- [j14]Lone Kiilerich, Sanne Wøhlk:
New large-scale data instances for CARP and new variations of CARP. INFOR Inf. Syst. Oper. Res. 56(1): 1-32 (2018) - [j13]Sanne Wøhlk, Gilbert Laporte:
A fast heuristic for large-scale capacitated arc routing problems. J. Oper. Res. Soc. 69(12): 1877-1887 (2018) - 2017
- [j12]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: 107-113 (2017) - [j11]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): 185-218 (2017) - 2016
- [j10]Maria Elbek, Sanne Wøhlk:
A variable neighborhood search for the multi-period collection of recyclable materials. Eur. J. Oper. Res. 249(2): 540-550 (2016) - [j9]Lukas Bach, Jens Lysgaard, Sanne Wøhlk:
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem. Networks 68(3): 161-184 (2016) - 2015
- [j8]Lukas Bach, Michel Gendreau, Sanne Wøhlk:
Freight railway operator timetabling and engine scheduling. Eur. J. Oper. Res. 241(2): 309-319 (2015) - 2014
- [j7]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): 800-810 (2014) - 2013
- [j6]Dan Black, Richard W. Eglese, Sanne Wøhlk:
The time-dependent prize-collecting arc routing problem. Comput. Oper. Res. 40(2): 526-535 (2013) - [j5]Lukas Bach, Geir Hasle, Sanne Wøhlk:
A lower bound for the Node, Edge, and Arc Routing Problem. Comput. Oper. Res. 40(4): 943-952 (2013) - 2010
- [j4]Kim S. Larsen, Sanne Wøhlk:
Competitive analysis of the online inventory problem. Eur. J. Oper. Res. 207(2): 685-696 (2010)
2000 – 2009
- 2009
- [j3]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): 392-398 (2009) - 2006
- [j2]Sanne Wøhlk:
New lower bound for the Capacitated Arc Routing Problem. Comput. Oper. Res. 33(12): 3458-3472 (2006) - [j1]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): 127-139 (2006) - 2005
- [c1]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: 397-408
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
