A dual RAMP algorithm for single source capacitated facility location problems

DOI10.1007/s10472-021-09756-0OpenAlexW3176074714MaRDI QIDQ2240710

Dorabela Gamboa, Óscar Oliveira, 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-09756-0

zbMATH Keywords

dual RAMPrelaxation adaptive memory programmingsingle source capacitated facility location problemSSCFLP

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items

Matheuristics: survey and synthesis

Uses Software

• RAMP
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic for BILP problems: the single source capacitated facility location problem
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A cutting plane algorithm for the capacitated facility location problem
• Scatter search for the single source capacitated facility location problem
• Efficient algorithms for the capacitated concentrator location problem
• An exact algorithm for the capacitated facility location problems with single sourcing
• Upper and lower bounds for the single source capacitated location problem.
• A repeated matching heuristic for the single-source capacitated facility location problem
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• Lagrangean heuristics for location problems
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• RAMP for the capacitated minimum spanning tree problem
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Efficient solution of large scale, single-source, capacitated plant location problems
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• Tabu Search—Part I
• Tabu Search—Part II
• Scatter Search and Path Relinking: Advances and Applications
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem