Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Xiucui Guan"'
Publikováno v:
Journal of Applied Mathematics, Vol 2013 (2013)
In a shortest path improvement problem under unit Hamming distance (denoted by SPIUH), an edge weighted graph with a set of source-terminal pairs is given; we need to modify the lengths of edges by a minimum cost under unit Hamming distance such that
Externí odkaz:
https://doaj.org/article/c65a357e10bd4d99859a918a2cf93f37
Publikováno v:
Journal of Global Optimization. 86:251-284
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea5e1ae484944711c8f983445e01a4b5
https://doi.org/10.1007/s10898-022-01256-7
https://doi.org/10.1007/s10898-022-01256-7
Publikováno v:
Journal of Global Optimization. 85:461-485
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a1ab0e315e37e0a3ab5bb2ed74432e6
https://doi.org/10.1007/s10898-022-01212-5
https://doi.org/10.1007/s10898-022-01212-5
Publikováno v:
Journal of Global Optimization. 84:715-738
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1a98048d0c2c643d5dcc4e5a0b796d2
https://doi.org/10.1007/s10898-022-01170-y
https://doi.org/10.1007/s10898-022-01170-y
Publikováno v:
Journal of Combinatorial Optimization
Network interdiction problems by upgading critical edges/nodes have important applications to reduce the infectivity of the COVID-19. A network of confirmed cases can be described as a rooted tree that has a weight of infectious intensity for each ed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b51277715e6147372f26454b0da7cbb
https://doi.org/10.1007/s10878-021-00819-w
https://doi.org/10.1007/s10878-021-00819-w
Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
Publikováno v:
Journal of Combinatorial Optimization. 41:861-887
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 n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43baf2f0eb3037385f3d8c05bd6c0e36
https://doi.org/10.1007/s10878-021-00721-5
https://doi.org/10.1007/s10878-021-00721-5
Publikováno v:
Optimization Letters. 15:2661-2680
We consider the maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (denoted by (MSPITH)), which has wide applications in transportation network, network war and terrorist network. The problem (MSPITH) aims t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::649dc133732b4c04c5d0fff1f8b58ca9
https://doi.org/10.1007/s11590-020-01687-9
https://doi.org/10.1007/s11590-020-01687-9
Publikováno v:
Journal of Global Optimization. 79:959-987
Network interdiction problems by deleting critical edges have wide applicatio ns. However, in some practical applications, the goal of deleting edges is difficult to achieve. We consider the maximum shortest path interdiction problem by upgrading edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54ae20e70dba4f899483d95cc7bb4ec6
https://doi.org/10.1007/s10898-020-00958-0
https://doi.org/10.1007/s10898-020-00958-0
Publikováno v:
Journal of Global Optimization. 79:757-777
We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit $$l_{\infty }$$ norm. Given an edge weighted connected undirected network $$G=(V,E,\varvec{w})$$ , a spanning tree $$T^0$$ , a lower bound vector $$\varve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a5abe2f20e97c90ebbb28f16fdded56
https://doi.org/10.1007/s10898-020-00947-3
https://doi.org/10.1007/s10898-020-00947-3
Publikováno v:
Optimization Letters. 14:2301-2322
We consider the inverse optimal value problem on minimum spanning tree under unit $$l_{\infty }$$ norm. Given an edge weighted connected undirected network $$G=(V, E, {\varvec{w}})$$ and a spanning trees $$T^0$$ , we aim to modify the weights of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cb6ebe4ed8ef2e771c3555ba1412edc
https://doi.org/10.1007/s11590-020-01553-8
https://doi.org/10.1007/s11590-020-01553-8