Skip to main content
SpringerLink
Log in

Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope

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

Abstract

The Generalized Cardinality-Constrained Shortest Path Problem (GCCSPP) consists in finding the minimum cost path in a digraph, using at most r arcs in a subset F of the arc set. We propose an algebraic characterization of the extreme points of the associated polytope, and then we show that it is equivalent to the geometric one, obtained extending to the GCCSPP some known results for the cardinality-constrained shortest path problem.

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. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ (1993)

    Google Scholar 

  2. Barnhart C., Hane C.A., Vance P.H. (2000) Using branch-and-price-and-cut to solve origin–destination integer multicommodity flow problems Oper. Res. 48(2):318–326.

    Article  Google Scholar 

  3. Desrochers, M., Soumis, F.: A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26, 191–212 (1988)

    MATH  Google Scholar 

  4. Dahl, G., Realfsen, B.: The cardinality-constrained shortest path problem in 2-graphs. Networks 36(1), 1–8 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dumitrescu, I., Boland, N.: Algorithms for the weight constrained shortest path problem. Int. Trans. Oper. Res. 8(1), 15–29 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3), 135–153 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  8. Martello, S., Toth, P.: Knapsack Problems—Algorithms and Computer Implementations. Wiley, New York (1990)

    MATH  Google Scholar 

  9. Moccia, L., Cordeau, J.-F., Monaco, M.F., Sammarra, M.: Formulations and solution algorithms for a Dynamic Generalized Assignment Problem, Technical Report CIRRELT-2007-16, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, Université de Montrèal, Canada (2007)

  10. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Via P. Bucci 41-C, 87036, Rende (CS), Italy

    Maria Flavia Monaco, Marcello Sammarra & Luigi Moccia

  2. TER-ENETEC Tecnologie per gli Usi Finali dell’Energia, ENEA Ente per le Nuove Tecnologie, l’Energia e l’Ambiente, C. R. Trisaia, S.S. Jonica 106, km 419+500, 75026, Rotondella (MT), Italy

    Luigi Moccia

Authors
  1. Maria Flavia Monaco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcello Sammarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luigi Moccia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maria Flavia Monaco.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Monaco, M.F., Sammarra, M. & Moccia, L. Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope. Optim Lett 2, 577–585 (2008). https://doi.org/10.1007/s11590-008-0084-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-008-0084-7

Keywords

Search

Navigation