A cutting plane algorithm for the capacitated facility location problem

DOI10.1007/s10589-007-9125-xzbMath1170.90432OpenAlexW2017019823MaRDI QIDQ842775

Pasquale Avella, Maurizio Boccia

Publication date: 25 September 2009

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9125-x

zbMATH Keywords

capacitated facility location problemfacet-enumerationmixed dicut inequalities

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (12)

A heuristic for BILP problems: the single source capacitated facility location problem ⋮ Benders decomposition without separability: a computational study for capacitated facility location problems ⋮ A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences ⋮ Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ RAMP algorithms for the capacitated facility location problem ⋮ A dual RAMP algorithm for single source capacitated facility location problems ⋮ Weak flow cover inequalities for the capacitated facility location problem ⋮ On single-source capacitated facility location with cost and fairness objectives ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs ⋮ An improved Lagrangian relaxation and dual ascent approach to facility location problems ⋮ A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem

Uses Software

• OR-Library
• Qhull

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A branch-and-price algorithm for the capacitated facility location problem
• Computational study of large-scale \(p\)-median problems
• An effective heuristic for large-scale capacitated facility location problems
• Valid inequalities and facets of the capacitated plant location problem
• Capacitated facility location: Separation algorithms and computational experience
• The 0-1 knapsack problem with a single continuous variable
• The volume algorithm: Producing primal solutions with a subgradient method
• Lagrangean heuristics for location problems
• The quickhull algorithm for convex hulls
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Capacitated Facility Location: Valid Inequalities and Facets

This page was built for publication: A cutting plane algorithm for the capacitated facility location problem