论文信息 - OR software - ORSEP operations research software exchange program Edited by Professor H.W. Hamacher K_TREE/K_SUBGRAPH: A program package for minimal weighted K-cardinality trees and subgraphs - 字舞流文

OR software - ORSEP operations research software exchange program Edited by Professor H.W. Hamacher K_TREE/K_SUBGRAPH: A program package for minimal weighted K-cardinality trees and subgraphs

Matthias Ehrgott | M. Ehrgott | J. Freitag | J. Freitag

[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3] Matteo Fischetti,et al. Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.

[4] R. Prim. Shortest connection networks and some generalizations , 1957 .

[5] M. Ehrgott,et al. Heuristics for the K-Cardinality Tree and Subgraph Problems , 1996 .

[6] M. Fischetti,et al. Weighted k-cardinality trees , 1992 .