New neighborhood search structures for the capacitated minimum spanning tree problem
Cover title. "November, 1998."
Other Authors: | Ahuja, Ravindra K., 1956- |
---|---|
Language: | eng |
Published: |
Sloan School of Management, Massachusetts Institute of Technology
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2731 |
Similar Items
-
A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem
Published: (2003) -
An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
Published: (2003) -
The transition problem in product development
Published: (2003) -
Combinatorial algorithms for inverse network flow problems
Published: (2003) -
Growth policies for biopharmaceutical companies : a dynamic problem definition
Published: (2003)