Skip to main content

Advertisement

SpringerLink
Log in

Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles

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

Abstract

In this paper, we discuss exact algorithm for the shortest elementary path problem in digraphs containing negative directed cycles. We investigate various classes of valid inequalities for the polytope of \(s-t\) elementary paths in digraphs. The problem of separation of these valid inequalities can be shown to be NP-hard, thus only solvable for small sized problems. To deal with larger problems, lifting techniques are proposed. We provide results of computational experiments to show the efficiency of lifted inequalities in reducing the integrality gap. Indeed, considering a series of difficult test examples, the integrality gap is shown to be \(100\,\%\) closed in about half of the cases within no more than ten rounds of cutting plane generation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bellman, R.: On routing problem. Q. Appl. Math. 16, 87–90 (1958)

    MATH  Google Scholar 

  2. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ford, L.R., Jr.: Networks flow theory. Paper P-923, The RAND Corporation, Santa Monica, California, [August 14] (1956)

  4. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111–121 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  5. Garey, M., Johnson, D.: Computer and Intractibility: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)

    Google Scholar 

  6. Gondran, M., Minoux, M.: Graphes et Algorithmes. Eyrolles, Paris (1995)

    Google Scholar 

  7. Hansen, P.: Bicreterion path problems. Multiple criteria decision making: theory and applications, LNEMS 177, pp. 109–127, Springer-verlag, Berlin

  8. Ibrahim, M.S.: Etude de formulations et inégalités valides pour le problème du plus court chemin dans les graphes avec des circuits absorbants. PhD dissertation, Université Pierre et Marie Curie, Paris 6 (2007)

  9. Ibrahim, M.S., Maculan, N., Minoux, M.: Strong flow-based formulation for the shortest path problem in digraphs with negative cycles. ITOR 16, 361–369 (2009)

    MATH  MathSciNet  Google Scholar 

  10. Di Puglia Pugliese, L., Guerriero, F.: On the shortest path problem with negative cost cycles. Technical Report n 5/10, 2010, LOGICA Laboratory, University of Calabria, Italy (2010)

  11. Klein, P.N., Mozes, S., Weimann, O.: Shortest paths in directed planar graphs with negative lengths: A linear space \(O(nlog^2 n)\)-time algorithm. ACM Trans. Algorithms (TALG) 6, 361–369 (2010)

    MathSciNet  Google Scholar 

  12. Lipton, R., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Anal. 16, 346–358 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lipton, R., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177–189 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  14. Maculan, N., Plateau, G., Lisser, A.: Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems. Pesquisa Oper. 23, 161–168 (2003)

    Article  Google Scholar 

  15. Mehlhorn, K., Priebe, V., Schafer, G., Sivadasan, N.: All-pairs shortest paths computation in the presence of negative cycles. Inf. Process. Lett. 81, 341–343 (2002)

    Article  MathSciNet  Google Scholar 

  16. Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. System Sci. 32(3), 265–279 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  17. Minoux, M.: Programmation mathématique. \(2^e\) édition Lavoisier (2008)

  18. Subramani, K.: A zero-space algorithm for negative cost cycle detection in networks. J. Discret. Algorithms 5, 408–421 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  19. Subramani, K., Kovalchick, L.: A greedy strategy for detecting negative cost cycles in networks. Future Gener. Comput. Systems 21(4), 607–623 (2005)

    Article  Google Scholar 

  20. Yamada, T., Kinoshita, H.: Finding all the negative cycles in a directedgraph. Discret. Appl. Math. 118, 279–291 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We gratefully acknowledge the referees for their careful reading and constructive comments.

Author information

Authors and Affiliations

  1. Faculté des Sciences, Université A. Moumouni, BP 10.622 , Niamey, Niger

    M. S. Ibrahim

  2. Federal University of Rio de Janeiro, Rio de Janeiro, Brazil

    N. Maculan

  3. Université Pierre et Marie Curie, Paris, France

    M. Minoux

Authors
  1. M. S. Ibrahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Maculan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Minoux
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. S. Ibrahim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ibrahim, M.S., Maculan, N. & Minoux, M. Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles. Optim Lett 9, 345–357 (2015). https://doi.org/10.1007/s11590-014-0747-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0747-5

Keywords

Search

Navigation