Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning

DOI10.1007/978-3-319-95104-1_7zbMath1439.90048OpenAlexW2887568814MaRDI QIDQ5111126

Mohammed El Amrani, Bernard Gendron, Y. Benadada

Publication date: 26 May 2020

Published in: Bioinspired Heuristics for Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-95104-1_7

zbMATH Keywords

column generationheuristiclocation\(p\)-medianset partitioning

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• The use of state space relaxation for the dynamic facility location problem
• Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
• Two exact algorithms for the capacitated \(p\)-median problem
• A column generation approach to capacitated \(p\)-median problems
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
• A branch-and-price approach to \(p\)-median location problems
• Exact solution methods for uncapacitated location problems with convex transportation costs
• Integrated location and two-echelon inventory network design under uncertainty
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• A branch‐and‐price algorithm for the capacitated p‐median problem
• Capacitated dynamic location problems with opening, closure and reopening of facilities
• A new method for solving capacitated location problems based on a set partitioning approach

This page was built for publication: Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning