default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJack A. A. van der Veen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j14]Jack A. A. van der Veen
, Taher Ahmadi, Bo van der Rhee, V. Venugopal:
The impact of collaboration on sustainability and profit in the fashion rental supply chain. Eur. J. Oper. Res. 329(1): 273-287 (2026)- 2025
- [j13]Bo van der Rhee, V. Venugopal, Jack A. A. van der Veen, Ata Zare:
Two's company, three's a crowd: on the bystander effect and other barriers to collaboration in multi-stage supply chains. Int. J. Prod. Res. 63(24): 10725-10743 (2025)
2010 – 2019
- 2013
- [j12]Bo van der Rhee, Jack A. A. van der Veen, V. Venugopal, Vijayender Reddy Nalla:
Corrigendum to "A new revenue sharing mechanism for coordinating multi-echelon supply chains" [Oper. Res. Lett. 38(4) (2010) 296-301]. Oper. Res. Lett. 41(5): 562 (2013) - 2010
- [j11]Bo van der Rhee, Jack A. A. van der Veen, V. Venugopal, Vijayender Reddy Nalla:
A new revenue sharing mechanism for coordinating multi-echelon supply chains. Oper. Res. Lett. 38(4): 296-301 (2010)
2000 – 2009
- 2005
- [j10]Jack A. A. van der Veen, V. Venugopal:
Using revenue sharing to create win-win in the video rental supply chain. J. Oper. Res. Soc. 56(7): 757-762 (2005)
1990 – 1999
- 1999
- [j9]Edo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen:
Solving the k-best traveling salesman problem. Comput. Oper. Res. 26(4): 409-425 (1999) - 1998
- [j8]Marek Libura, Edo S. Van der Poort, Gerard Sierksma, Jack A. A. van der Veen:
Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions. Discret. Appl. Math. 87(1-3): 159-185 (1998) - [j7]Jack A. A. van der Veen, Gerhard J. Woeginger, Shuzhong Zhang:
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP. Math. Program. 82: 235-254 (1998) - [j6]Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen, Gerhard J. Woeginger:
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. SIAM Rev. 40(3): 496-546 (1998) - 1997
- [j5]Jatinder N. D. Gupta, Johnny C. Ho, Jack A. A. van der Veen:
Single machine hierarchical scheduling with customer orders and multiple job classes. Ann. Oper. Res. 70: 127-143 (1997) - 1996
- [j4]Jack A. A. van der Veen, Shuzhong Zhang:
Low-complexity algorithms for sequencing jobs with a fixed number of job-classes. Comput. Oper. Res. 23(11): 1059-1067 (1996) - [j3]René van Dal, Gert A. Tijssen, Zsolt Tuza, Jack A. A. van der Veen, Christina Zamfirescu, Tudor Zamfirescu:
Hamiltonian properties of Toeplitz graphs. Discret. Math. 159(1-3): 69-81 (1996) - 1994
- [j2]Jack A. A. van der Veen:
A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems. SIAM J. Discret. Math. 7(4): 585-592 (1994) - 1993
- [j1]Jack A. A. van der Veen:
An O(n) Algorithm to Solve the Bottleneck Traveling Salesman Problem Restricted to Ordered Product Matrices. Discret. Appl. Math. 47(1): 57-75 (1993)
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-02-26 23:23 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:
