The following pages link to Cees W. Duin (Q531431):
Displayed 30 items.
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- (Q732900) (redirect page) (← links)
- On a pair of job-machine assignment problems with two stages (Q732901) (← links)
- Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Two fast algorithms for all-pairs shortest paths (Q875428) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times (Q1046715) (← links)
- An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
- Reducing the hierarchical network design problem (Q1121181) (← links)
- (Q1179752) (redirect page) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- An addendum to the hierarchical network design problem (Q1268252) (← links)
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
- The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
- A branch-checking algorithm for all-pairs shortest paths (Q1763152) (← links)
- On Steiner versions of (bi)connectivity in network problems (Q1889834) (← links)
- On weighting two criteria with a parameter in combinatorial optimization problems (Q1926813) (← links)
- The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099) (← links)
- Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs (Q2766100) (← links)
- (Q3481517) (← links)
- Some generalizations of the steiner problem in graphs (Q3787806) (← links)
- Reduction tests for the steiner problem in grapsh (Q3826622) (← links)
- Efficient path and vertex exchange in steiner tree algorithms (Q4367276) (← links)
- (Q4395322) (← links)
- The edge-disjoing steiner problem in graphs (Q4893707) (← links)
- (Q4945800) (← links)