default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWouter Kool 0001
Person information
- affiliation: ORTEC, Zoetermeer, The Netherlands
- affiliation (former): University of Amsterdam, The Netherlands
Other persons with the same name
- Wouter Kool 0002 — Washington University in St. Louis, MO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Niels A. Wouda
, Leon Lan, Wouter Kool:
PyVRP: A High-Performance VRP Solver Package. INFORMS J. Comput. 36(4): 943-955 (2024)- [i6]Niels A. Wouda, Leon Lan, Wouter Kool:
PyVRP: a high-performance VRP solver package. CoRR abs/2403.13795 (2024) - 2023
- [j2]Iris A. M. Huijben, Wouter Kool, Max B. Paulus, Ruud J. G. van Sloun:
A Review of the Gumbel-max Trick and its Extensions for Discrete Stochasticity in Machine Learning. IEEE Trans. Pattern Anal. Mach. Intell. 45(2): 1353-1371 (2023) - [c7]Thomas R. Visser, Ruggiero Seccia, Wouter Merkx, Wouter Kool, Leendert Kok:
Machine Learning Applications in Route Planning for Attended Home Delivery. BNAIC/BENELEARN 2023: 119-134 - 2022
- [c6]Wouter Kool, Herke van Hoof, Joaquim A. S. Gromicho, Max Welling:
Deep Policy Dynamic Programming for Vehicle Routing Problems. CPAIOR 2022: 190-213 - 2021
- [c5]Wouter Kool, Laurens Bliek, Danilo Numeroso, Yingqian Zhang, Tom Catshoek, Kevin Tierney, Thibaut Vidal, Joaquim A. S. Gromicho:
The EURO Meets NeurIPS 2022 Vehicle Routing Competition. NeurIPS (Competition and Demos) 2021: 35-49 - [i5]Wouter Kool, Herke van Hoof, Joaquim A. S. Gromicho, Max Welling:
Deep Policy Dynamic Programming for Vehicle Routing Problems. CoRR abs/2102.11756 (2021) - [i4]Wouter Kool, Chris J. Maddison, Andriy Mnih:
Unbiased Gradient Estimation with Balanced Assignments for Mixtures of Experts. CoRR abs/2109.11817 (2021) - 2020
- [j1]Wouter Kool, Herke van Hoof, Max Welling:
Ancestral Gumbel-Top-k Sampling for Sampling Without Replacement. J. Mach. Learn. Res. 21: 47:1-47:36 (2020) - [c4]Wouter Kool, Herke van Hoof, Max Welling:
Estimating Gradients for Discrete Random Variables by Sampling without Replacement. ICLR 2020 - [i3]Wouter Kool, Herke van Hoof, Max Welling:
Estimating Gradients for Discrete Random Variables by Sampling without Replacement. CoRR abs/2002.06043 (2020)
2010 – 2019
- 2019
- [c3]Wouter Kool, Herke van Hoof, Max Welling:
Attention, Learn to Solve Routing Problems! ICLR (Poster) 2019 - [c2]Wouter Kool, Herke van Hoof, Max Welling:
Buy 4 REINFORCE Samples, Get a Baseline for Free! DeepRLStructPred@ICLR 2019 - [c1]Wouter Kool, Herke van Hoof, Max Welling:
Stochastic Beams and Where To Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacement. ICML 2019: 3499-3508 - [i2]Wouter Kool, Herke van Hoof, Max Welling:
Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacement. CoRR abs/1903.06059 (2019) - 2018
- [i1]Wouter Kool, Max Welling:
Attention Solves Your TSP. CoRR abs/1803.08475 (2018)
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 2025-01-09 20:34 CET 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:
