Pages that link to "Item:Q4291483"
From MaRDI portal
The following pages link to Improving the location of minimax facilities through network modification (Q4291483):
Displaying 10 items.
- Minimising maximum response time (Q336510) (← links)
- The inverse 1-maxian problem with edge length modification (Q941835) (← links)
- Reverse 2-median problem on trees (Q943832) (← links)
- Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
- Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← links)
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
- Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
- The center location improvement problem under the Hamming distance (Q1781802) (← links)
- Assigning weights to minimize the covering radius in the plane (Q2331208) (← links)