The following pages link to Covering part of a planar network (Q291695):
Displaying 16 items.
- A mean-shift algorithm for large-scale planar maximal covering location problems (Q322404) (← links)
- On covering location problems on networks with edge demand (Q342492) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- A minimum length covering subgraph of a network (Q920001) (← links)
- The variable radius covering problem (Q1027534) (← links)
- The \(K\)-coverage concentrator location problem (Q1193145) (← links)
- The \(p\) maximal cover -- \(p\) partial center problem on networks (Q1317171) (← links)
- An heuristic algorithm for handling multiple responses (Q1583918) (← links)
- On the overlap area of a disk and a piecewise circular domain (Q1725599) (← links)
- A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances (Q1753405) (← links)
- Transmitter location for maximum coverage and constructive-destructive interference management (Q1762133) (← links)
- Cooperative cover of uniform demand (Q2005869) (← links)
- A computational approach for eliminating error in the solution of the location set covering problem (Q2253405) (← links)
- Continuous maximal covering location problems with interconnected facilities (Q2668753) (← links)
- Covering continuous demand in the plane (Q3585713) (← links)
- A defensive maximal covering problem on a network (Q3601204) (← links)
