The following pages link to (Q4511232):
Displayed 11 items.
- The inverse 1-maxian problem with edge length modification (Q941835) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068) (← links)
- Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
- The center location improvement problem under the Hamming distance (Q1781802) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)