RAMP algorithms for the capacitated facility location problem
From MaRDI portal
Publication:2240709
DOI10.1007/s10472-021-09757-zOpenAlexW3176173648MaRDI QIDQ2240709
Óscar Oliveira, Dorabela Gamboa, Telmo Matos
Publication date: 4 November 2021
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-021-09757-z
Uses Software
Cites Work
- Kernel search: an application to the index tracking problem
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A cutting plane algorithm for the capacitated facility location problem
- An effective heuristic for large-scale capacitated facility location problems
- Heuristics for the capacitated plant location model
- An algorithm for solving large capacitated warehouse location problems
- Partitioning procedures for solving mixed-variables programming problems
- The capacitated plant location problem
- Lagrangean heuristics for location problems
- Greedy randomized adaptive search procedures
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
- RAMP for the capacitated minimum spanning tree problem
- A direct dual method for the mixed plant location problem with some side constraints
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- Tabu Search—Part I
- Parallel metaheuristics: recent advances and new trends
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
