Skip to main content
SpringerLink
Log in

Metric Inequalities and the Network Loading Problem

  • Conference paper
Integer Programming and Combinatorial Optimization (IPCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3064))

Abstract

Given a simple graph G(V,E) and a set of traffic demands between the nodes of G, the Network Loading Problem consists of installing minimum cost integer capacities on the edges of G allowing routing of the traffic demands.

In this paper we study the Capacity Formulation of the Network Loading Problem, introducing the new class of the Tight Metric Inequalities, that completely characterize the convex hull of the integer feasible solutions of the problem. We present separation algorithms for Tight Metric Inequalities and a cutting plane algorithm, reporting on computational experience.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atamturk, A.: On Capacitated Network Design Cut-Set Polyhedra. Math. Progr. 92, 425–437 (2002)

    Article  MathSciNet  Google Scholar 

  2. Atamturk, A., Rajan, D.: On Splittable and Unsplittable Capacitated Network Design Arc-Set Polyhedra. Math. Progr. 92, 315–333 (2002)

    Article  MathSciNet  Google Scholar 

  3. Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Network Design. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization. ch. 18, Wiley, Chichester (1997)

    Google Scholar 

  4. Barahona, F.: Network Design Using Cut Inequalities. SIAM J. Optimization 6-3, 823–837 (1996)

    Article  MathSciNet  Google Scholar 

  5. Berger, D., Gendron, B., Potvin, J.Y., Raghavan, S., Soriano, P.: Tabu Search for a Network Loading Problem with Multiple Facilities. J. of Heuristics (1999) (to appear)

    Google Scholar 

  6. Bienstock, D.: Experiments with a Network Design Algorithm using -approximate Linear Programs (1996) (manuscript )

    Google Scholar 

  7. Bienstock, D.: Approximately solving large-scale linear programs. I: Strengthening lower bounds and accelerating convergence, CORC Report 1999-1, Columbia University (1999)

    Google Scholar 

  8. Bienstock, D.: Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice. Kluwer, Boston (2002)

    MATH  Google Scholar 

  9. Bienstock, D., Bley, A.: Capacitated Network Design with Mulicast Commodities. In: Proc. of 8th International Conference on Telecommunication Systems, Nashville, March 9-12 (2000)

    Google Scholar 

  10. Bienstock, D., Chopra, S., Günlük, O., Tsai, C.: Minimum Cost Capacity Installation for Multicommodity Network Flows. Math. Progr. 81, 177–199 (1998)

    MATH  Google Scholar 

  11. Bienstock, D., Günlük, O.: Computational Experience with a Difficult Mixed-Integer Multicommodity Flow Problem. Math. Progr. 68, 213–237 (1995)

    MATH  Google Scholar 

  12. Bienstock, D., Günlük, O.: Capacitated Network Design–Polyhedral Structure, and Computation. INFORMS Journal On Computing 8(3), 243–259 (1996)

    Article  MATH  Google Scholar 

  13. Bienstock, D., Raskina, O.: Asymptotic Analysis of the Flow Deviation Method for the Maximum Concurrent Flow Problem. Math. Progr. 91, 379–392 (2002)

    Article  MathSciNet  Google Scholar 

  14. Caprara, M.: Fischetti: {0, 1 2 }-Chvátal-Gomory Cuts. Math. Progr. 74, 221–235 (1996)

    MathSciNet  MATH  Google Scholar 

  15. Caprara, M., Fischetti, A.N.: Letchford: On the Separation of Maximally Violated mod-k Cuts. Math. Progr. 87-1, 37–56 (2000)

    MathSciNet  Google Scholar 

  16. Chopra, S., Gilboa, I., Sastry, S.T.: Source Sink Flows with Capacity Installation in Batches. Disc. Appl. Math. 85, 165–192 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. Crainic, T.G., Frangioni, A., Gendron, B.: Multicommodity Capacitated Network Design. In: Sansó, B., Soriano, P. (eds.) Telecommunications Network Planning, Kluwer Academic, Dordrecht (1998)

    Google Scholar 

  18. Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design Problems. Discrete Applied Mathematics (1998) (to appear)

    Google Scholar 

  19. Crainic, T.G., Gendreau, M.: Cooperative Parallel Tabu Search for Capacitated Network Design, Centre de recherche sur les transports, Report CRT-98-71, Université de Montrèal (1998)

    Google Scholar 

  20. Crainic, T.G., Gendreau, M., Farvolden, J.: Simplex-Based Tabu Search for the Multicommodity Capacitated Fixed Charge Network Design Problem. INFORMS Journal on Computing 12(3), 223–236 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  21. Dahl, G., Stoer, M.: A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing 10(1), 1–11 (1998)

    Article  MathSciNet  Google Scholar 

  22. Deza, M., Laurent, M.: Geometry of Cuts and Metrics. Springer, Berlin (1997)

    MATH  Google Scholar 

  23. Eisenbrand, F.: On the Membership Problem for the Elementary Closure of a Polyhedron. Combinatorica 19, 297–300 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  24. Fleischer, L.: Approximating Fractional Multicommodity Flows Independent of the Number of Commodities. SIAM Journal Discrete Mathematics 13(4), 505–520 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  25. Günlük, O.: A Branch-and-Cut Algorithm for Capacitated Network Design Problems. Math. Progr. 86, 17–39 (1999)

    Article  MATH  Google Scholar 

  26. Günlük, O.: A new min-cut max-flow ratio for multicommodity flow problems. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, p. 54. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  27. Holmberg, K., Yuan, D.: A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. Operations Research 48-3, 461–481 (2000)

    Article  MathSciNet  Google Scholar 

  28. Iri, M.: On an extension of the max-flow min-cut theorem to multicommodity flows. Journal of the Operations Research Society of Japan 13, 129–135 (1971)

    MATH  MathSciNet  Google Scholar 

  29. Letchford, A.N.: Totally Tight Chvátal-Gomory Cuts. Operations Research Letters 30(2), 71–73 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  30. Lomonosov, M.: Feasibility conditions for multiflow problems. Discrete Mathematics (1982)

    Google Scholar 

  31. Lomonosov, M., Sebo, A.: On the geodesic structure of graphs: a polyhedral approach to metric decomposition. In: Proceedings of IPCO, pp. 221–234 (1993)

    Google Scholar 

  32. Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and Solving the Core Capacitated Network Loading Problem. Operations Research 43(1), 142–157 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  33. Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and Solving the Two- Facility Capacitated Network Loading Problem. Operations Research 43(1), 142–157 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  34. Onaga, K., Kakusho, O.: On feasibility conditions of multicommodity flows in networks. Transactions on Circuit Theory CT-18(4), 425–429 (1971)

    Article  MathSciNet  Google Scholar 

  35. Stoer, M., Dahl, G.: A polyhedral approach to multicommodity network design. Numerische Mathematik 68, 149–167 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  36. Wolsey, L.A.: Integer Programming. Wiley, Chichester (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RCOST Research Center on Software Technology, Università del Sannio, Viale Traiano, 82100, Benevento, Italy

    Pasquale Avella

  2. Dipartimento di Informatica e Sistemistica, Università di Roma ”La Sapienza”, Via Buonarroti, 12, 00185, Roma, Italy

    Sara Mattia & Antonio Sassano

Authors
  1. Pasquale Avella
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sara Mattia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Sassano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of IEOR, Columbia University, 500 West 120th Street, 10027, New York, NY, USA

    Daniel Bienstock

  2. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA

    George Nemhauser

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avella, P., Mattia, S., Sassano, A. (2004). Metric Inequalities and the Network Loading Problem. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25960-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22113-5

  • Online ISBN: 978-3-540-25960-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation