The cable trench problem: Combining the shortest path and minimum spanning tree problems

Computers and Operations Research

Volumn 29, Issue 5, 2001, Pages 441-458

  Vasko, Francis J ^a,b   Barbieri, Robert S ^a   Rieksts, Brian Q ^a   Reitmeyer, Kenneth L ^b   Stott Jr , Kenneth L ^b  

^a KUTZTOWN UNIVERSITY   (United States)

^b Bethlehem Steel Corporation   (United States)

Author keywords

Graph theory; Heuristics; Minimum spanning tree; Networks; NP completeness; Shortest path

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

CABLE TRENCH PROBLEM;

OPERATIONS RESEARCH;

NETWORK ANALYSIS;

EID: 0036132449     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00083-6     Document Type: Article

References (21)

1. A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
2. A constrained minimum spanning tree problem
3. A note on two problems in connection with graphs
4. Shortest path along an MST
5. Balancing minimum spanning trees and shortest-path trees
6. On the shortest spanning subtree of a graph and the traveling salesman problem
7. Shortest connection networks and some generalizations
8. Counterexample to minimum spanning tree = shortest path tree?
9. Genetic algorithm approach on multi-criteria minimum spanning tree problem