On Benders’ Decomposition for the Capacitated Facility Location Problem

  • Paul Wentges
Conference paper


In [van Roy 1986] an algorithm is presented to strengthen Benders’ cuts, if Benders’ decomposition is applied to solve the capacitated facility location problem. Referring to this algorithm an idea is presented to construct stronger cuts and first results are discussed. The pareto-optimality of these cuts in the sense of [Magnanti/Wong 1981] is shown under a weak assumption.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Domschke/DrexI1985]
    Domschke, W./ Drexl, A.: ADD-heuristics Starting Procedures for Capacitated Plant Location Models. European Journal of Operational Research 21 (1985), p. 47–53.CrossRefGoogle Scholar
  2. [Magnanti/Wong 1981]
    Magnanti, T.L./ Wong, R.T.: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria. Operations Research 29 (1981), p. 464–484.CrossRefGoogle Scholar
  3. [Magnanti/Wong 1989]
    Magnanti, T.L./ Wong, R.T.: Decomposition Methods for Facility Location Problems. In: Mirchandani, P.B./Francis, R.L. (eds.): Discrete Location Theory, Wiley Interscience, New York 1989, p. 209–262.Google Scholar
  4. [van Roy 1986]
    van Roy, T.: A Cross Decompositon Algorithm for Capacitated Facility Location. Operations Research 34 (1986), p. 145–163.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Paul Wentges
    • 1
  1. 1.Institut für UnternehmensforschungHochschule St. GallenSt. GallenSwitzerland

Personalised recommendations