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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of global optimization Ročník 79; číslo 3; s. 757 - 777
Hlavní autori:	Zhang, Binwu, Guan, Xiucui, Pardalos, Panos M., Wang, Hui, Zhang, Qiao, Liu, Yan, Chen, Shuyi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2021 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!