scientific article; zbMATH DE number 1522936

MaRDI QIDQ4511232zbMATH OpenFDO

Authors Jianzhong Zhang, Xiaoguang Yang, Mao-Cheng Cai

Publication date 6 March 2001

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)

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

Cited in

(12)

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

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)