scientific article; zbMATH DE number 1522936
From MaRDI portal
Publication:4511232
zbMath0968.90048MaRDI QIDQ4511232
Zhang, Jianzhong, Xiao-guang Yang, Mao-cheng Cai
Publication date: 6 March 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Upgrading edges in the maximal covering location problem ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ Inapproximability and a polynomially solvable special case of a network improvement problem. ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ The inverse 1-maxian problem with edge length modification ⋮ The 0-1 inverse maximum stable set problem ⋮ The center location improvement problem under the Hamming distance ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs
