Some models for inverse minimum spanning tree problem with uncertain edge weights

The inverse minimum spanning tree (IMST) problem is an inverse optimization problem in which one makes the least modification to the edge weights of a predetermined spanning tree, to make it the minimum spanning tree with respect to new edge weights. For a deterministic environment, the problem ha...

Full description

Bibliographic Details
Main Authors: Sagarika Biswal, Ganesh Ghorai
Format: Article
Language:English
Published: Prince of Songkla University 2022-10-01
Series:Songklanakarin Journal of Science and Technology (SJST)
Subjects:
Online Access:https://sjst.psu.ac.th/journal/44-5/26.pdf