RAMP experiments in solving the uncapacitated facility location problem
From MaRDI portal
Publication:6496425
DOI10.1007/S10472-023-09920-8MaRDI QIDQ6496425
Publication date: 3 May 2024
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Calculus of variations and optimal control; optimization (49-XX) Operations research, mathematical programming (90-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple tabu search for warehouse location
- Foundations of location analysis
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A method for solving to optimality uncapacitated location problems
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- A tabu search approach to the uncapacitated facility location problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- Near-optimal solutions to large-scale facility location problems
- Scatter search. Methodology and implementation in C. With CD-ROM.
- RAMP algorithms for the capacitated facility location problem
- Solving the uncapacitated facility location problem using tabu search
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- Solving the simple plant location problem by genetic algorithm
- Location Theory
- A Dual-Based Procedure for Uncapacitated Facility Location
- Tabu Search—Part I
- Tabu Search—Part II
- Adaptive memory programming: a unified view of metaheuristics
This page was built for publication: RAMP experiments in solving the uncapacitated facility location problem