Cees Duin

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
On weighting two criteria with a parameter in combinatorial optimization problems	2012-12-29	Paper
A reduction approach to the repeated assignment problem	2011-04-29	Paper
Improved polynomial algorithms for robust bottleneck problems with interval data	2009-12-22	Paper
A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times	2009-12-22	Paper
On a pair of job-machine assignment problems with two stages	2009-10-15	Paper
The partial inverse minimum spanning tree problem when weight increase is forbidden	2008-02-13	Paper
On the complexity of adjacent resource scheduling	2007-05-15	Paper
Two fast algorithms for all-pairs shortest paths	2007-04-13	Paper
Looking ahead with the pilot method	2006-03-09	Paper
Some inverse optimization problems under the Hamming distance	2005-12-05	Paper
A branch-checking algorithm for all-pairs shortest paths	2005-02-21	Paper
On Steiner versions of (bi)connectivity in network problems	2004-12-13	Paper
Solving group Steiner problems as Steiner problems.	2004-02-02	Paper
The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs	2002-01-27	Paper
The dynamic predicate stashing copy problem and the Steiner problem in graphs	2001-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q4945800	2000-03-23	Paper
The partial sum criterion for Steiner trees in graphs and shortest paths	1999-02-22	Paper
An addendum to the hierarchical network design problem	1998-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q4395322	1998-06-11	Paper
Efficient path and vertex exchange in steiner tree algorithms	1997-11-25	Paper
The edge-disjoing steiner problem in graphs	1996-09-18	Paper
The multi-weighted Steiner tree problem	1992-06-27	Paper
Minimum deviation and balanced optimization: A unified approach	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3481517	1989-01-01	Paper
Reducing the hierarchical network design problem	1989-01-01	Paper
An edge elimination test for the Steiner problem in graphs	1989-01-01	Paper
Reduction tests for the steiner problem in grapsh	1989-01-01	Paper
Some generalizations of the steiner problem in graphs	1987-01-01	Paper

Research outcomes over time

This page was built for person: Cees Duin