On the inverse problem of minimum spanning tree with partition constraints
- 1 June 1996
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 44 (2) , 171-187
- https://doi.org/10.1007/bf01194328
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An algorithm for inverse minimum spanning tree problemOptimization Methods and Software, 1997
- Calculating some inverse linear programming problemsJournal of Computational and Applied Mathematics, 1996
- A column generation method for inverse shortest path problemsMathematical Methods of Operations Research, 1995
- An inverse problem of the weighted shortest path problemJapan Journal of Industrial and Applied Mathematics, 1995
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 1994
- On an instance of the inverse shortest paths problemMathematical Programming, 1992
- Integer and Combinatorial OptimizationJournal of the Operational Research Society, 1990
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- Optimum Restricted Base of a MatroidPublished by Elsevier ,1980
- Graph Theory with ApplicationsPublished by Springer Nature ,1976