A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes

@article{Boccia2008ACA,
  title={A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes},
  author={Maurizio Boccia and Antonio Sforza and Claudio Sterle and Igor Vasil'ev},
  journal={J. Math. Model. Algorithms},
  year={2008},
  volume={7},
  pages={43-58}
}
The capacitated p-median problem (CPMP) consists of finding p nodes (the median nodes) minimizing the total distance to the other nodes of the graph, with the constraint that the total demand of the nodes assigned to each median does not exceed its given capacity. In this paper we propose a cutting plane algorithm, based on Fenchel cuts, which allows us to considerably reduce the integrality gap of hard CPMP instances. The formulation strengthened with Fenchel cuts is solved by a commercial MIP… CONTINUE READING
BETA

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS, ESTIMATED 40% COVERAGE

57 Citations

01020'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…