dr. C.W. Duin
-
Faculty of Economics and Business
Section Econometrics & Statistics
-
Valckenierstraat
65
1018 XE Amsterdam
-
C.W.Duin@uva.nl
T: 0205254285
T: 0205254252
Positions
docent / research fellow
Research programme
Operations Research
Research interests
- Combinatorial Optimisation
- Network Design
- Efficient Algorithms
Dissertation title
Steiner's problem in graphs: reduction, approximation, variation Universiteit van Amsterdam 1994
Teaching activities
Current year
Operationele Research 1D,
Operationele Research 2D,
Combinatorische Optimalisering R.,
Operations Scheduling,
Programmeren B
Previous years
Operationele Management 2,
Operation Management Cases,
Produktie- en Voorraadtheorie,
Programmeren A,
Operationele Research 1D
Thesis supervision
2010
- H. Gong, L. Tang & C.W. Duin (2010). A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Computers & Operations Research, 37 (5), 960-969. doi: 10.1016/j.cor.2009.08.001
- A. Volgenant & C.W. Duin (2010). Improved polynomial algorithms for robust bottleneck problems with interval data. Computers & Operations Research, 37 (5), 909-915. doi: 10.1016/j.cor.2009.03.013
- A. Volgenant & C.W. Duin (2010). On a pair of job-machine assignment problems with two stages. Computers & Operations Research, 37 (2), 334-340. doi: 10.1016/j.cor.2009.05.009
2008
- M-C. Cai, C.W. Duin, X. Yang & J. Zhang (2008). The partial inverse minimum spanning tree problem when weight increase is forbidden. European Journal of Operational Research, 188 (2), 348-353.
2007
- C.W. Duin (2007). Two fast algorithms for all-pairs shortest paths. Computers & Operations Research, 34 (9), 2824-2839.
2006
- R. Haijema, C.W. Duin & N.M. van Dijk (2006). Train shunting: A practical heuristic inspired by Dynamic Programming. In R.J. Jorna, W. van Wezel & A. Meystel (Eds.), Planning in Intelligent Systems: Aspects, Motivations and Methods (pp. 437-476). New York: Wiley.
- C.W. Duin & A. Volgenant (2006). Some inverse optimization problems under the Hamming distance. European Journal of Operational Research, 170 (3), 887-899.
- C.W. Duin & E. van der Sluis (2006). On the complexity of Adjacent Resource Scheduling. Journal of Scheduling, 9 (1), 49-62.
2005
- S. Voß, A. Finke & C.W. Duin (2005). Looking ahead with the Pilot Method. Annals of Operations Research, 136 (1), 285-302. doi: 10.1007/s10479-005-2060-2
- C.W. Duin (2005). A Branch-Checking Algorithm for All-Pairs Shortest Paths. Algorithmica, 41, 131-145.
2004
- A. Volgenant & C.W. Duin (2004). On Steiner versions of (bi)connectivity in network problems. Graphs and Combinatorics, 20 (2), 263-273.
- C.W. Duin, A. Volgenant & S. Voß (2004). Solving group Steiner problems as Steiner problems. European Journal of Operational Research, 154 (1), 323-329.
2000
- C.W. Duin (2000). Preprocessing the Steiner problem in graph. In D. Du, J.M. Smith & J.H. Rubinstein (Eds.), Advances in Steiner trees. Series in Combinatorial Optimization (6) (pp. 173-233). Deventer: Kluwer Academic Publishers.
- C.W. Duin, S. Marsman & A. Volgenant (2000). The Dynamic Predicate Stashing Copy Problem and the Steiner Problem in Graphs. European Journal of Operational Research, 526-534.
1999
- C.W. Duin & S. Voss (1999). The Pilot Method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 181-191.
1998
- C.W. Duin (1998). Reducing the graphical Steiner problem with a sensitivity test. DIMACS series in discrete mathematics and theoretical computer science, 40, 79-107.
1997
- C.W. Duin & A. Volgenant (1997). The parial sum criterion for Steiner trees in graphs and shortest paths. European Journal of Operational Research, 97, 172-182.
- C.W. Duin & S. Voss (1997). Efficient path and vertex exchange in Steiner tree algorithms. Networks, 29, 89-105.
1996
- C.W. Duin & A. Volgenant (1996). An addendum to the hierarchical network design problem. European Journal of Operational Research, 92, 214-216.
- F.A. Compagner, C.W. Duin & A. Volgenant (1996). The edge-disjoint Steiner problem in graphs. Optimization, 36, 153-165.
1998
- A. Volgenant, C.W. Duin & S. Marsman (1998). The dynamic predicate stashing copy problem and the Steiner problem in Graphs. AE-report, 5/98.
1996
- C.W. Duin & S. Voss (1996). The pilot method; a strategie of heuristic repetition with application to the Steiner problem in graphs. Report AE, 96 (20).
1995
- C.W. Duin & A. Volgenant (1995). Minmax Steiner biconnected subgraphs and Steiner bipartition of biconnected graphs. (intern rapport, AE Report, no 8/95). : .
- C.W. Duin & S. Voss (1995). Efficient path and vertex exchange in Steiner tree algorithms. (intern rapport, AE Report, no 4/95). : .
- C.W. Duin & A. Volgenant (1995). An addendum to the hierarchical network design problem. (intern rapport, AE Report, no 24/95). : .
2004
- C.W. Duin & E. van der Sluis (2004). On the complexity of adjacent resource scheduling. (Preprints, Report AE, no 6/2004). Amsterdam: Institute of Actuarial Science & Econometrics.[go to publisher's site]
This page has been automatically generated by the UvA-Current Research Information System. If you have any questions about the content of this page, please contact the UBAcoach or the Metis staff of your faculty / institute. To edit your publications login to Personal Metis.
- No ancillary activities