Pages that link to "Item:Q4320083"
From MaRDI portal
The following pages link to Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing (Q4320083):
Displaying 16 items.
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
- Kohonen maps for solving a class of location-allocation problems (Q1296007) (← links)
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
- Annealing algorithms for multisource absolute location problems on graph (Q1356068) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing (Q1376761) (← links)
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances. (Q1427111) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem (Q2255905) (← links)
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem (Q2256914) (← links)
- An improved substation locating and sizing method based on the weighted Voronoi diagram and the transportation model (Q2336737) (← links)
- Determination of lockbox collection points via simulated annealing (Q3157294) (← links)
- (Q3360009) (← links)
- Tabu search for large location–allocation problems (Q4346458) (← links)
