The lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm

We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit l ∞ norm. Given an edge weighted connected undirected network G = ( V , E , w ) , a spanning tree T 0 , a lower bound vector l and a value K , we aim to find a new weight vector w ¯ respecting the lower b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of global optimization Jg. 79; H. 3; S. 757 - 777
Hauptverfasser: Zhang, Binwu, Guan, Xiucui, Pardalos, Panos M., Wang, Hui, Zhang, Qiao, Liu, Yan, Chen, Shuyi
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.03.2021
Springer Nature B.V
Schlagworte:
Algorithms
Computer Science
Graph theory
Lower bounds
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Polynomials
Real Functions
Weight
Inverse optimal value problem
Strongly polynomial time algorithm
Minimum spanning tree
norm
ISSN:0925-5001, 1573-2916
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit l ∞ norm. Given an edge weighted connected undirected network G = ( V , E , w ) , a spanning tree T 0 , a lower bound vector l and a value K , we aim to find a new weight vector w ¯ respecting the lower bound such that T 0 is a minimum spanning tree under the vector w ¯ with weight K , and the objective is to minimize the modification cost under unit l ∞ norm. We present a mathematical model of the problem. After analyzing optimality conditions of the problem, we develop a strongly polynomial time algorithm with running time O (| V || E |). Finally, we give an example to demonstrate the algorithm and present the numerical experiments.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-020-00947-3