E-viri
Recenzirano
-
Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distanceWang, Hui; Guan, Xiucui; Zhang, Qiao; Zhang, Binwu
Journal of combinatorial optimization, 05/2021, Letnik: 41, Številka: 4Journal Article
We consider the capacitated inverse optimal value problem on minimum spanning tree under Hamming distance. Given a connected undirected network G = ( V , E ) and a spanning tree T 0 , we aim to modify the weights of the edges such that T 0 is not only the minimum spanning tree under the new weights but also the weight of T 0 is equal to a given value K . The objective is to minimize the modification cost under bottleneck Hamming distance. We add a lower bound l and an upper bound u on the modification of weights and consider three cases (uncapacitated, lower bounded, capacitated) of the problem based on the bound vectors. Suppose l = - ∞ , u = + ∞ in the uncapacitated problem, l > - ∞ , u = + ∞ in the lower bounded problem and l > - ∞ , u < + ∞ in the capacitated problem. We present three mathematical models of these problems. After analyzing the properties, we develop three strongly polynomial time algorithms based on binary search to solve the problems. The time complexities for solving the uncapacitated, the lower bounded and capacitated problems are all O ( | V | | E | log | E | ) time. Finally, we do some numerical experiments to show the effectiveness of the algorithms.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.