Pages that link to "Item:Q1327241"
From MaRDI portal
The following pages link to A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241):
Displaying 14 items.
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
- Region-rejection based heuristics for the capacitated multi-source Weber problem (Q1000993) (← links)
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations (Q1013385) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- A fast algorithm for the rectilinear distance location problem (Q1616792) (← links)
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
- The location-allocation problem of drone base stations (Q2273669) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)
- Global Optimization Procedures for the Capacitated Euclidean and <i>l<sub>p</sub></i> Distance Multifacility Location-Allocation Problems (Q3635104) (← links)
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing (Q4320083) (← links)
