Advertisement

Computational Optimization and Applications

, Volume 34, Issue 3, pp 377–407 | Cite as

Polyhedral Analysis for Concentrator Location Problems

  • Martine Labbé
  • Hande Yaman
Article

Abstract

The concentrator location problem is to choose a subset of a given terminal set to install concentrators and to assign each remaining terminal node to a concentrator to minimize the cost of installation and assignment. The concentrators may have capacity constraints. We study the polyhedral properties of concentrator location problems with different capacity structures. We develop a branch and cut algorithm and present computational results.

Keywords

Valid Inequality Open Node Dummy Node Cover Inequality Knapsack Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. Aardal, Y. Pochet, and L.A. Wolsey, “Capacitated facility location: Valid inequalities and facets,” Mathematics of Operations Research, vol. 20, pp. 562–582, 1995.MathSciNetMATHGoogle Scholar
  2. 2.
    K. Aardal, “Capacitated facility location: Separation algorithms and computational experience,” Mathematical Programming, vol. 81, pp. 149–175, 1998.MATHMathSciNetGoogle Scholar
  3. 3.
    P. Avella and A. Sassano, “On the p-median polytope,” Mathematical Programming, vol. 89, pp. 395–411, 2001.MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    E. Balas, “Facets of the Knapsack Polytope,” Mathematical Programming, vol. 8, pp. 146–164, 1975.MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    E. Balas and J.B. Mazzola, “Nonlinear 0-1 Programming: I. Linearization Techniques,” Mathematical Programming, vol. 30, pp. 1–21, 1984.MathSciNetMATHGoogle Scholar
  6. 6.
    J.E. Beasley, “OR-Library: distributing test problems by electronic mail,” Journal of the Operational Research Society, vol. 41, pp. 1069–1072, 1990.CrossRefGoogle Scholar
  7. 7.
    G. Carello, F. Della Croce, M. Ghirardi, and R. Tadei, “Solving hub location problem in telecommunication network design: A local search approach,” Networks, vol. 44, pp. 94–105, 2004.MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Th. Christof, Ein Verfharen zur Transformation Zwischen Polyederdarstellungen, Diplomarbeit, Universität Augsburg, 1991.Google Scholar
  9. 9.
    Q. Deng and D. Simchi-Levi, “Valid inequalities, facets and computational results for the capacitated concentrator location problem,” Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027–6699, 1992.Google Scholar
  10. 10.
    M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.MATHGoogle Scholar
  11. 11.
    E. Gourdin, M. Labbé, and H. Yaman, Telecommunication and Location. In Facility Location: Applications and Theory, Z.Drezner and H.W. Hamacher (Eds.), Springer, pp. 275–305, 2002.Google Scholar
  12. 12.
    Z. Gu, G.L. Nemhauser and M.W.P. Savelsbergh, “Cover Inequalities for 0-1 Linear Programs: Computation,” INFORMS Journal on Computing, vol. 10, pp. 427–437, 1998.MathSciNetCrossRefGoogle Scholar
  13. 13.
    P.L. Hammer, E.L. Johnson, and U.N. Peled, “Facets of Regular 0-1 Polytopes,” Mathematical Programming, vol. 8, pp. 179–206, 1975.MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    M. Júnger and S. Thienel, “The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization,” Softw. Pract. Experience, vol. 30, pp. 1325–1352, 2000.CrossRefGoogle Scholar
  15. 15.
    M. Labbé, H. Yaman, and E. Gourdin, “A branch and cut algorithm for hub location problems with single assignment,” Mathematical Programming, vol. 102, pp. 371–405, 2005.MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    J.M.Y. Leung and T.L. Magnanti, “Valid inequalities and facets of the capacitated plant location problem,” Mathematical Programming, vol. 44, pp. 271–291, 1989.MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.MATHGoogle Scholar
  18. 18.
    G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.MATHGoogle Scholar
  19. 19.
    M.W. Padberg, “On the facial structure of set packing polyhedra,” Mathematical Programming, vol. 5, pp. 199–215, 1973.MATHMathSciNetCrossRefGoogle Scholar
  20. 20.
    L. Wolsey, “Faces for a linear inequality in 0-1 variables,” Mathematical Programming, vol. 8, pp. 165–178, 1975.MATHMathSciNetCrossRefGoogle Scholar
  21. 21.
    H. Yaman, Concentrator Location in Telecommunications Networks, Springer, 2005.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Département d’InformatiqueUniversité Libre de BruxellesBruxellesBelgium
  2. 2.Department of Industrial EngineeringBilkent UniversityBilkentTurkey

Personalised recommendations