Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

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


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 solver. Computational results show that this approach is effective in solving hard instances or considerably reducing their integrality gap.

This is a preview of subscription content, log in to check access.


  1. 1.

    Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Implementing the Dantzig–Fulkerson–Johnson algorithm for large traveling salesman problems. Math. Program. 97, 91153 (2003)

  2. 2.

    Baldacci, R., Hadjiconstantinou, E., Maniezzo, V., Mingozzi, A.: A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29, 365–386 (2002)

  3. 3.

    Boyd, E.: Generating Fenchel cutting planes for knapsack polyhedra. SIAM J. Optim. 3, 734–750 (1993a)

  4. 4.

    Boyd, E.: Solving integer programs with cutting planes and preprocessing. In: IPCO 1993, pp. 209–220 (1993b)

  5. 5.

    Boyd, E.: Fenchel cutting planes for integer programming. Oper. Res. 42, 53–64 (1994)

  6. 6.

    Boyd, E.: On the convergence Fenchel cutting planes in mixed-integer programming. SIAM J. Optim. 5, 421–435 (1995)

  7. 7.

    Ceselli, A.: Two exact algorithms for the capacitated p-median problem. 4OR 1, 319–340 (2003)

  8. 8.

    Ceselli, A., Righini, G.: A branch and price algorithm for the capacitated p-median problem. Networks 45(3), 125–142 (2005)

  9. 9.

    CPLEX: ILOG CPLEX 10.0 Reference manual. ILOG (2006)

  10. 10.

    Diaz, J., Fernandez, E.: Hybrid scater search and path relinking for the capacitated p-median problem. Eur. J. Oper. Res. 169(2), 570–585 (2006)

  11. 11.

    Lorena, L., Senne, E.: Local search heuristics for capacitated p-median problems. Netw. Spat. Econ. 3, 407–419 (2003)

  12. 12.

    Lorena, L., Senne, E.: A column generation approach to capacitated p-median problems. Comput. Oper. Res. 31(6), 863–876 (2004)

  13. 13.

    Maniezzo, V., Mingozzi, A., Baldacci, R.: A Biotomic approach to the capacitated p-median problem. J Heuristics 4, 263–280 (1998)

  14. 14.

    Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)

  15. 15.

    Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer programming. Math. Program. A 99, 283–296 (2004)

  16. 16.

    Pirkul, H.: Efficient algorithms for the capacitated concentrator location problem. Comput. Oper. Res. 13, 197–208 (1987)

  17. 17.

    Pisinger, D.: A minimal algorithm for the 0–1 knapsack problem. Oper. Res. 46, 758–767 (1995)

  18. 18.

    Ramos, M., Saez, J.: Solving capacitated facility location problems by Fenchel cutting planes. J. Oper. Res. Soc. 0, 1–10 (2004)

  19. 19.

    Ross, G., Soland, R.: Modeling facility location problems as generalized assignment problem. Manage. Sci. 24(3), 345–357 (1977)

  20. 20.

    Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831–841 (1997)

Download references

Author information

Correspondence to Maurizio Boccia.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Boccia, M., Sforza, A., Sterle, C. et al. A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes. J Math Model Algor 7, 43–58 (2008).

Download citation


  • p-Median problem
  • Cutting planes
  • Fenchel cuts

Mathematics Subject Classification (2000)

  • 90C57