scientific article; zbMATH DE number 1522936

zbMATH Open0968.90048MaRDI QIDQ4511232FDOQ4511232

Authors: Jianzhong Zhang, Xiaoguang Yang, Mao-Cheng Cai 

Publication date: 6 March 2001

Title of this publication is not available (Why is that?)

Recommendations

• Some reverse location problems
• Reverse 1-centre problem on trees under convex piecewise-linear cost function
• scientific article; zbMATH DE number 1932373
• Inverse center location problem on a tree
• Further study on reverse 1-center problem on trees

zbMATH Keywords

NP-hardrelaxationsatisfiability problemnetworks and graphsmaximum cost circulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cited In (12)

• Upgrading the 1-center problem with edge length variables on a tree
• Upgrading edges in the maximal covering location problem
• Reverse 1-centre problem on trees under convex piecewise-linear cost function
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• The inverse 1-maxian problem with edge length modification
• The 0-1 inverse maximum stable set problem
• Weight reduction problems with certain bottleneck objectives.
• Inapproximability and a polynomially solvable special case of a network improvement problem.
• Some reverse location problems
• The center location improvement problem under the Hamming distance
• Reverse maximum flow problem under the weighted Chebyshev distance

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511232)