default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDirk Van Oudheusden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j21]Reginald Dewil
, Pieter Vansteenwegen, Dirk Cattrysse, Dirk Van Oudheusden:
A minimum cost network flow model for the maximum covering and patrol routing problem. Eur. J. Oper. Res. 247(1): 27-36 (2015)- 2013
- [j20]Osman Ali, Paul Valckenaers, Jan Van Belle, Bart Saint Germain, Paul Verstraete, Dirk Van Oudheusden:
Towards online planning for open-air engineering processes. Comput. Ind. 64(3): 242-251 (2013) - [j19]Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden:
The Multiconstraint Team Orienteering Problem with Multiple Time Windows. Transp. Sci. 47(1): 53-63 (2013) - 2011
- [j18]Pieter Vansteenwegen, Wouter Souffriau, Dirk Van Oudheusden:
The orienteering problem: A survey. Eur. J. Oper. Res. 209(1): 1-10 (2011) - [j17]Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, Dirk Van Oudheusden:
The City Trip Planner: An expert system for tourists. Expert Syst. Appl. 38(6): 6540-6546 (2011) - 2010
- [j16]Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden:
A Path Relinking approach for the Team Orienteering Problem. Comput. Oper. Res. 37(11): 1853-1859 (2010)
2000 – 2009
- 2009
- [j15]Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, Dirk Van Oudheusden:
Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12): 3281-3290 (2009) - [j14]Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, Dirk Van Oudheusden:
A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1): 118-127 (2009) - [c5]Wouter Souffriau, Joris Maervoet, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden:
A Mobile Tourist Decision Support System for Small Footprint Devices. IWANN (1) 2009: 1248-1255 - 2008
- [j13]Wouter Souffriau, Pieter Vansteenwegen, Joris Vertommen, Greet Vanden Berghe, Dirk Van Oudheusden:
A Personalized Tourist Trip Design Algorithm for Mobile Tourist Guides. Appl. Artif. Intell. 22(10): 964-985 (2008) - [p1]Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden:
Automated Parameterisation of a Metaheuristic for the Orienteering Problem. Adaptive and Multilevel Metaheuristics 2008: 255-269 - 2007
- [j12]Mark Moonen, Dirk Cattrysse, Dirk Van Oudheusden:
Organising patrol deployment against violent crimes. Oper. Res. 7(3): 401-417 (2007) - [j11]Pieter Vansteenwegen, Dirk Van Oudheusden:
The Mobile Tourist Guide: An OR Opportunity. OR Insight 20(3): 21-27 (2007) - [j10]Mark Moonen, Dirk Cattrysse, Dirk Van Oudheusden:
Ram Raids and Hold-ups. OR Insight 20(4): 32-40 (2007) - 2006
- [j9]Hartanto Wong, G. J. van Houtum, Dirk Cattrysse, Dirk Van Oudheusden:
Multi-item spare parts systems with lateral transshipments and waiting time constraints. Eur. J. Oper. Res. 171(3): 1071-1093 (2006) - [j8]Pieter Vansteenwegen, Dirk Van Oudheusden:
Developing railway timetables which guarantee a better service. Eur. J. Oper. Res. 173(1): 337-350 (2006) - [c4]Pieter Vansteenwegen, Dirk Van Oudheusden:
Selection of tourist attractions and routing using personalised electronic guides. ENTER 2006: 55 - 2005
- [j7]Hartanto Wong, Dirk Cattrysse, Dirk Van Oudheusden:
Inventory pooling of repairable spare parts with non-zero lateral transshipment time and delayed lateral transshipments. Eur. J. Oper. Res. 165(1): 207-218 (2005) - [j6]Luc Muyldermans, Patrick Beullens, Dirk Cattrysse, Dirk Van Oudheusden:
Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem. Oper. Res. 53(6): 982-995 (2005) - [j5]Hartanto Wong, G. J. van Houtum, Dirk Cattrysse, Dirk Van Oudheusden:
Simple, efficient heuristics for multi-item multi-location spare parts systems with lateral transshipments and waiting time constraints. J. Oper. Res. Soc. 56(12): 1419-1430 (2005) - [j4]H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove:
Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs. J. Sched. 8(2): 161-177 (2005) - 2003
- [j3]Patrick Beullens, Luc Muyldermans, Dirk Cattrysse, Dirk Van Oudheusden:
A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. 147(3): 629-643 (2003) - [j2]Luc Muyldermans, Dirk Cattrysse, Dirk Van Oudheusden:
District design for arc-routing applications. J. Oper. Res. Soc. 54(11): 1209-1221 (2003) - 2002
- [j1]Luc Muyldermans, Dirk Cattrysse, Dirk Van Oudheusden, T. Lotan:
Districting for salt spreading operations. Eur. J. Oper. Res. 139(3): 521-532 (2002) - [c3]Hartanto Wong, Dirk Cattrysse, Dirk Van Oudheusden:
Modeling the Interaction between Operational and Financial Decisions in the Inventory Pooling of Repairable Spare Parts Problem. OR 2002: 120-125 - 2000
- [c2]Patrick Beullens, Dirk Van Oudheusden:
Throughput time reduction in a self-service restaurant: the free flow case. ESM 2000: 367-374
1990 – 1999
- 1998
- [c1]Laurens G. Debo, Dirk Van Oudheusden, Dirk Cattrysse, F. Roodhofft:
Industrial buyer-supplier relationships: guidelines for a successful marriage. Strategic Management of the Manufacturing Value Chain 1998: 361-368
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-04-24 22:55 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:
