Pages that link to "Item:Q2480210"
From MaRDI portal
The following pages link to A fast swap-based local search procedure for location problems (Q2480210):
Displaying 14 items.
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
- Emergency facility location under random network damage: insights from the Istanbul case (Q337665) (← links)
- A Lagrangian heuristic algorithm for a public healthcare facility location problem (Q363567) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
- A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights (Q1684321) (← links)
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
- A new method for managing the uncertainties in evaluating multi-person multi-criteria location choices, using a perceptual computer (Q1761878) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering (Q2066643) (← links)
- Convex fuzzy \(k\)-medoids clustering (Q2219180) (← links)
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems (Q2253990) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
