An algorithm for inverse minimum spanning tree problem

Optimization Methods and Software

Volumn 8, Issue 1, 1997, Pages 69-84

  Zhang, Jianzhong ^a   Xu, Shaoji ^b   Ma, Zhongfan ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b RUTGERS UNIVERSITY   (United States)

^c INSTITUTE OF SYSTEMS SCIENCE   (China)

Author keywords

Bipartite graph; Inverse problem; Minimum covering set; Spanning tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INVERSE PROBLEMS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

BIPARTITE GRAPH; INVERSE MINIMUM SPANNING TREE;

TREES (MATHEMATICS);

EID: 0031336931     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789708805666     Document Type: Article

References (2)

1. D. Burton and Ph. L. Toint (1992). On an instance of the inverse shortest paths problem. Mathematical Programming, 53, 45-61.
2. S. Xu and J. Zhang (1995). An inverse problem of the whighted shortest path problem, The Japan Journal of Industrial and Applied Mathematics, 12, 47-59.