Cees Duin

From MaRDI portal
Person:531431

Available identifiers

zbMath Open duin.cees-wMaRDI QIDQ531431

List of research outcomes





PublicationDate of PublicationType
On weighting two criteria with a parameter in combinatorial optimization problems2012-12-29Paper
A reduction approach to the repeated assignment problem2011-04-29Paper
Improved polynomial algorithms for robust bottleneck problems with interval data2009-12-22Paper
A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times2009-12-22Paper
On a pair of job-machine assignment problems with two stages2009-10-15Paper
The partial inverse minimum spanning tree problem when weight increase is forbidden2008-02-13Paper
On the complexity of adjacent resource scheduling2007-05-15Paper
Two fast algorithms for all-pairs shortest paths2007-04-13Paper
Looking ahead with the pilot method2006-03-09Paper
Some inverse optimization problems under the Hamming distance2005-12-05Paper
A branch-checking algorithm for all-pairs shortest paths2005-02-21Paper
On Steiner versions of (bi)connectivity in network problems2004-12-13Paper
Solving group Steiner problems as Steiner problems.2004-02-02Paper
The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs2002-01-27Paper
The dynamic predicate stashing copy problem and the Steiner problem in graphs2001-09-03Paper
https://portal.mardi4nfdi.de/entity/Q49458002000-03-23Paper
The partial sum criterion for Steiner trees in graphs and shortest paths1999-02-22Paper
An addendum to the hierarchical network design problem1998-10-18Paper
https://portal.mardi4nfdi.de/entity/Q43953221998-06-11Paper
Efficient path and vertex exchange in steiner tree algorithms1997-11-25Paper
The edge-disjoing steiner problem in graphs1996-09-18Paper
The multi-weighted Steiner tree problem1992-06-27Paper
Minimum deviation and balanced optimization: A unified approach1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34815171989-01-01Paper
Reducing the hierarchical network design problem1989-01-01Paper
An edge elimination test for the Steiner problem in graphs1989-01-01Paper
Reduction tests for the steiner problem in grapsh1989-01-01Paper
Some generalizations of the steiner problem in graphs1987-01-01Paper

Research outcomes over time

This page was built for person: Cees Duin