default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCees Duin
Person information
- affiliation: University of Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j20]C. W. Duin, A. Volgenant:
On weighting two criteria with a parameter in combinatorial optimization problems. Eur. J. Oper. Res. 221(1): 1-6 (2012)- 2011
- [j19]Daisuke Yokoya, Cees W. Duin, Takeo Yamada:
A reduction approach to the repeated assignment problem. Eur. J. Oper. Res. 210(2): 185-193 (2011) - 2010
- [j18]A. Volgenant, C. W. Duin:
On a pair of job-machine assignment problems with two stages. Comput. Oper. Res. 37(2): 334-340 (2010) - [j17]A. Volgenant, C. W. Duin:
Improved polynomial algorithms for robust bottleneck problems with interval data. Comput. Oper. Res. 37(5): 909-915 (2010) - [j16]Hua Gong, Lixin Tang
, C. W. Duin:
A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Comput. Oper. Res. 37(5): 960-969 (2010)
2000 – 2009
- 2008
- [j15]Mao-cheng Cai, C. W. Duin, Xiaoguang Yang, Jianzhong Zhang:
The partial inverse minimum spanning tree problem when weight increase is forbidden. Eur. J. Oper. Res. 188(2): 348-353 (2008) - 2007
- [j14]C. W. Duin:
Two fast algorithms for all-pairs shortest paths. Comput. Oper. Res. 34(9): 2824-2839 (2007) - 2006
- [j13]C. W. Duin, A. Volgenant:
Some inverse optimization problems under the Hamming distance. Eur. J. Oper. Res. 170(3): 887-899 (2006) - [j12]Cees Duin, E. Van Der Sluis:
On the Complexity of Adjacent Resource Scheduling. J. Sched. 9(1): 49-62 (2006) - 2005
- [j11]Cees Duin:
A Branch-Checking Algorithm for All-Pairs Shortest Paths. Algorithmica 41(2): 131-145 (2005) - [j10]Stefan Voß, Andreas Fink, Cees Duin:
Looking Ahead with the Pilot Method. Ann. Oper. Res. 136(1): 285-302 (2005) - 2004
- [j9]C. W. Duin, A. Volgenant, Stefan Voß:
Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154(1): 323-329 (2004) - [j8]A. Volgenant, C. W. Duin:
On Steiner Versions of (bi)Connectivity in Network Problems. Graphs Comb. 20(2): 263-273 (2004) - 2000
- [j7]S. Marsman, C. W. Duin, A. Volgenant:
The dynamic predicate stashing copy problem and the Steiner problem in graphs. Eur. J. Oper. Res. 125(3): 526-534 (2000)
1990 – 1999
- 1999
- [j6]Cees Duin, Stefan Voß:
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34(3): 181-191 (1999) - 1997
- [j5]Cees Duin, Stefan Voß:
Efficient path and vertex exchange in steiner tree algorithms. Networks 29(2): 89-105 (1997) - [c1]Cees Duin:
Reducing the graphical Steiner problem with a sensitivity test. Network Design: Connectivity and Facilities Location 1997: 79-107 - 1991
- [j4]Cees Duin, Ton Volgenant:
The multi-weighted Steiner tree problem. Ann. Oper. Res. 33(6): 451-469 (1991) - [j3]C. W. Duin, A. Volgenant:
Minimum deviation and balanced optimization: A unified approach. Oper. Res. Lett. 10(1): 43-48 (1991)
1980 – 1989
- 1989
- [j2]C. W. Duin, A. Volgenant:
Reduction tests for the steiner problem in grapsh. Networks 19(5): 549-567 (1989) - 1987
- [j1]C. W. Duin, A. Volgenant:
Some generalizations of the steiner problem in graphs. Networks 17(3): 353-364 (1987)
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 23:00 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:
