A Polyhedral Intersection Theorem for Capacitated Spanning Trees.
Leslie A. HallThomas L. MagnantiPublished in: Math. Oper. Res. (1992)
Keyphrases
- spanning tree
- minimum total cost
- minimum cost
- edge disjoint
- network flow problem
- minimum spanning tree
- np hard
- capacity constraints
- minimum spanning trees
- routing problem
- multi period
- single source
- lot sizing
- multi item
- multi source
- convex hull
- facility location problem
- root node
- weighted graph
- vehicle routing problem
- facility location
- von neumann
- vehicle routing problem with stochastic demands
- edge weights
- line drawings
- network design problem
- undirected graph
- production inventory
- multi commodity
- tabu search
- linear programming
- upper bound