2007 | OriginalPaper | Buchkapitel
Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
verfasst von : Longcheng Liu, Enyu Yao
Erschienen in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The inverse optimization problem is to modify the weight (or cost, length, capacity and so on) such that a given feasible solution becomes an optimal solution. In this paper, we consider the inverse min-max spanning tree problem under the weighted sum-type Hamming distance. For the model considered, we present its combinatorial algorithm that run in strongly polynomial times.