default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWim Nuijten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c13]Minshuo Li, Yaoxin Wu, Pavel Troubil, Yingqian Zhang, Wim P. M. Nuijten:
Towards Solving Polynomial-Objective Integer Programming with Hypergraph Neural Networks. CPAIOR 2026: 297-313- [i6]Minshuo Li, Yaoxin Wu, Pavel Troubil, Yingqian Zhang, Wim P. M. Nuijten:
Towards Solving Polynomial-Objective Integer Programming with Hypergraph Neural Networks. CoRR abs/2603.19318 (2026) - 2025
- [j8]Igor G. Smit
, Jianan Zhou, Robbert Reijnen, Yaoxin Wu, Jian Chen, Cong Zhang, Zaharah Bukhsh, Yingqian Zhang, Wim Nuijten:
Graph neural networks for job shop scheduling problems: A survey. Comput. Oper. Res. 176: 106914 (2025) - [c12]Igor G. Smit, Yaoxin Wu, Pavel Troubil, Yingqian Zhang, Wim P. M. Nuijten:
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems. AAAI 2025: 26678-26687 - [c11]Thijs Overmeer, Tim Janssen, Wim Nuijten:
Revisiting Expected Possession Value in Football: Introducing a U-Net Architecture, Reward and Risk for Passes, and a Benchmark. icSPORTS 2025: 100-109 - [c10]Bram Biemans, Pavel Troubil, Isel Grau, Wim P. M. Nuijten:
Explainable Optimization: Leveraging Large Language Models for User-Friendly Explanations. xAI (3) 2025: 44-67 - [i5]Thijs Overmeer, Tim Janssen, Wim P. M. Nuijten:
Revisiting Expected Possession Value in Football: Introducing a Benchmark, U-Net Architecture, and Reward and Risk for Passes. CoRR abs/2502.02565 (2025) - [i4]Riccardo Lo Bianco, Remco M. Dijkman, Wim Nuijten, Willem van Jaarsveld:
A Universal Approach to Feature Representation in Dynamic Task Assignment Problems. CoRR abs/2507.03579 (2025) - 2024
- [c9]Riccardo Lo Bianco, Remco M. Dijkman, Wim Nuijten, Willem van Jaarsveld:
A Universal Approach to Feature Representation in Dynamic Task Assignment Problems. BPM (Forum) 2024: 197-213 - [i3]Igor G. Smit, Jianan Zhou, Robbert Reijnen, Yaoxin Wu, Jian Chen, Cong Zhang, Zaharah Bukhsh, Wim Nuijten, Yingqian Zhang:
Graph Neural Networks for Job Shop Scheduling Problems: A Survey. CoRR abs/2406.14096 (2024) - [i2]Igor G. Smit, Yaoxin Wu, Pavel Troubil, Yingqian Zhang, Wim P. M. Nuijten:
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems. CoRR abs/2412.14052 (2024) - 2023
- [c8]Riccardo Lo Bianco, Remco M. Dijkman, Wim Nuijten, Willem van Jaarsveld:
Action-Evolution Petri Nets: A Framework for Modeling and Solving Dynamic Task Assignment Problems. BPM 2023: 216-231 - [i1]Riccardo Lo Bianco, Remco M. Dijkman, Wim Nuijten, Willem van Jaarsveld:
Action-Evolution Petri Nets: a Framework for Modeling and Solving Dynamic Task Assignment Problems. CoRR abs/2306.02910 (2023) - 2021
- [c7]Aleksei Karetnikov, Wim Nuijten, Marwan Hassani:
Data-driven Support of Coaches in Professional Cycling using Race Performance Prediction. icSPORTS 2021: 43-53 - 2020
- [c6]Robbert Reijnen, Yingqian Zhang, Wim Nuijten, Çaglar Senaras, Mariana Goldak-Altgassen:
Combining Deep Reinforcement Learning with Search Heuristics for Solving Multi-Agent Path Finding in Segment-based Layouts. SSCI 2020: 2647-2654
2010 – 2019
- 2017
- [j7]Dori van Hulst, Dick den Hertog, Wim Nuijten:
Robust shift generation in workforce planning. Comput. Manag. Sci. 14(1): 115-134 (2017) - [j6]Maikel L. van Eck, Murat Firat, Wim P. M. Nuijten, Natalia Sidorova, Wil M. P. van der Aalst:
Human Performance-Aware Scheduling and Routing of a Multi-Skilled Workforce. Complex Syst. Informatics Model. Q. 12: 1-21 (2017) - 2014
- [j5]Maryam SteadieSeifi, Nico P. Dellaert, Wim Nuijten, Tom Van Woensel, Rasa Raoufi:
Multimodal freight transportation planning: A literature review. Eur. J. Oper. Res. 233(1): 1-15 (2014)
2000 – 2009
- 2006
- [r1]Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten:
Constraint-Based Scheduling and Planning. Handbook of Constraint Programming 2006: 761-799 - 2005
- [c5]Daniel Godard, Philippe Laborie, Wim Nuijten:
Randomized Large Neighborhood Search for Cumulative Scheduling. ICAPS 2005: 81-89 - [c4]Thomas Bousonville, Filippo Focacci, Claude Le Pape, Wim Nuijten, Frederic Paulin, Jean-Francois Puget, Anna Robert, Alireza Sadeghin:
Integration of Rules and Optimization in Plant PowerOps. CPAIOR 2005: 1-15 - 2000
- [j4]Francis Sourd, Wim Nuijten:
Multiple-Machine Lower Bounds for Shop-Scheduling Problems. INFORMS J. Comput. 12(4): 341-352 (2000) - [c3]Filippo Focacci, Philippe Laborie, Wim Nuijten:
Solving Scheduling Problems with Setup Times and Alternative Resources. AIPS 2000: 92-101
1990 – 1999
- 1999
- [j3]Philippe Baptiste, Claude Le Pape, Wim Nuijten:
Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems. Ann. Oper. Res. 92: 305-333 (1999) - [c2]Pascal Van Hentenryck, Laurent Michel, Philippe Laborie, Wim Nuijten, Jerome Rogerie:
Combinatorial Optimization in OPL Studio. EPIA 1999: 1-15 - 1998
- [j2]Wim Nuijten, Claude Le Pape:
Constraint-Based Job Shop Scheduling with \sc Ilog Scheduler. J. Heuristics 3(4): 271-286 (1998) - 1995
- [j1]A. E. Eiben, Emile H. L. Aarts, Kees M. van Hee, W. P. M. Nuijten:
A unifying approach to heuristic search. Ann. Oper. Res. 55(1): 81-99 (1995) - 1994
- [c1]W. P. M. Nuijten, Emile H. L. Aarts:
Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling. ECAI 1994: 635-639
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 2026-07-28 00:44 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
