A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs | Optimization Letters Skip to main content
Springer Nature Link
Log in

A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The focus of this paper is on finding optimal solutions for the problem of maximal partitioning of graphs with supply and demand (MPGSD) for arbitrary graphs. A mixed integer programming (MIP) model is developed for the problem of interest. We also present some specific constraints that can be used in the case of tree graphs. With the goal of lowering the computational cost for solving the underlying model, a preprocessing stage is included. It is used to produce additional constraints based on shortest paths in the graph. With the aim of exploring the effectiveness of the proposed MIP formulation we have performed computational experiments for general graphs and trees. The main objective of the tests is to observe the properties and sizes of supply/demand graphs that can be solved to optimality using the proposed approach in reasonable time. The conducted computational experiments have shown that the proposed method is especially suitable for sparse graphs.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Narayanaswamy, N.S., Ramakrishna, G.: Linear time algorithm for tree t-spanner in outerplanar graphs via supply-demand partition in trees. In: CoRR. abs/1210.7919 (2012)

  2. Ito, T., Zhou, X., Nishizeki, T.: Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16(4), 803–827 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kawabata, M., Nishizeki, T.: Partitioning trees with supply, demand and edge-capacity. IEICE Trans. 96–A(6), 1036–1043 (2013)

    Article  Google Scholar 

  4. Ito, T., Demaine, E.D., Zhou, X., Nishizeki, T.: Approximability of partitioning graphs with supply and demand. J. Discret. Algorithms 6(4), 627–650 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ito, T., Zhou, X., Nishizeki, T.: Partitioning trees of supply and demand. Lect. Notes. Comput. Sci. 2518, 612–623 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Jovanovic, R., Tuba, M., Voß, S.: An ant colony optimization algorithm for partitioning graphs with supply and demand. Techn. Rep. (2014)

  7. Popa, A.: Modelling the power supply network—hardness and approximation. Lect. Notes. Comput. Sci. 7876, 62–71 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jovanovic, R., Bousselham, A., Voß, S.: A heuristic method for solving the problem of partitioning graphs with supply and demand. Ann. Oper. Res. (2015). doi:10.1007/s10479-015-1930-5

  9. Morishita, S., Nishizeki, T.: Parametric power supply networks. Lect. Notes. Comput. Sci. 7936, 245–256 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. Morishita, S., Nishizeki, T.: Parametric power supply networks. J. Comb. Optim. 29(1), 1–15 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lin, M., Li, W., Feng, Q.: Parameterized minimum cost partition of a tree with supply and demand. Lect. Notes. Comput. Sci. 9130, 180 (2015)

    Article  MATH  Google Scholar 

  12. Jovanovic, R., Bousselham, A., Voß, S.: Partitioning of supply/demand graphs with capacity limitations: an ant colony approach. J. Comb. Optim. (2015). doi:10.1007/s10878-015-9945-z

  13. Inoue, K., Nishizeki, T.: Spanning distribution forests of graphs. Lect. Notes. Comput. Sci. 9130, 117–127 (2014)

    Article  MATH  Google Scholar 

  14. Kawabata, M., Nishizeki, T.: Spanning distribution trees of graphs. IEICE Trans. Inf. Syst. 97(3), 406–412 (2014)

    Article  MATH  Google Scholar 

  15. Morgan, M., Grout, V.: Finding optimal solutions to backbone minimisation problems using mixed integer programming. In: Proceedings of the 7th International Network Conference (INC 2008). pp 53–64 (2008)

Download references

Author information

Authors and Affiliations

  1. Qatar Environment and Energy Research Institute (QEERI), Hamad bin Khalifa University, PO Box 5825, Doha, Qatar

    Raka Jovanovic

  2. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

  3. Escuela de Ingenieria Industrial, Pontificia Universidad Católica de Valparaíso, Valparaiso, Chile

    Stefan Voß

Authors
  1. Raka Jovanovic
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Stefan Voß
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Raka Jovanovic.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jovanovic, R., Voß, S. A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs. Optim Lett 10, 1693–1703 (2016). https://doi.org/10.1007/s11590-015-0972-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0972-6

Keywords