Pages that link to "Item:Q1603329"
From MaRDI portal
The following pages link to Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works (Q1603329):
Displayed 8 items.
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification (Q709153) (← links)
- Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
- A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
- A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
- The heuristic concentration-integer and its application to a class of location problems (Q960388) (← links)
- Solving the maximal covering location problem with heuristic concentration (Q2384889) (← links)
- Solving the hub location problem with modular link capacities (Q2387305) (← links)
- Allocating servers to facilities, when demand is elastic to travel and waiting times (Q5479858) (← links)