Minimum cost path problems with relays

  title={Minimum cost path problems with relays},
  author={Gilbert Laporte and Marta M. B. Pascoal},
  journal={Computers & OR},
The Minimum Cost Path Problem with Relays (MCPPR) consists of finding a minimum cost path from a source to a destination, along which relay nodes are located at a certain cost, subject to a weight constraint. This paper first models the MCPPR as a particular bicriteria path problem involving an aggregated function of the path and relay costs, as well as a weight function. A variant of this problem that takes into account all three functions separately is then considered. Formulating the MCPPR… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 16 extracted citations


Publications referenced by this paper.
Showing 1-10 of 11 references

Label correcting methods to solve multicriteria shortest path problems

  • F. Guerriero, R. Musmanno
  • Journal of Optimization Theory and Applications,
  • 2001
1 Excerpt

Locating postal relay boxes using a set covering algorithm

  • J. Bouliane, G. Laporte
  • American Journal of Mathematical and Management…
  • 1992
2 Excerpts

On the theory of dynamic programming Locating postal relay boxes using a set covering algorithm

  • Brumbaugh-Smith, D. R. Shier
  • Amer - ican Journal of Mathematical and…
  • 1992

An empirical investigation of some bicriterion shortest path algorithms

  • J. Brumbaugh-Smith, D. R. Shier
  • European Journal of Operational Research,
  • 1989
2 Excerpts

On a multicriteria shortest path problem

  • E. Martins
  • European Journal of Operational Research,
  • 1984
1 Excerpt

Bicriterion path problems

  • P. Hansen
  • Multiple Criteria Decision Making: Theory and…
  • 1980
1 Excerpt

Similar Papers

Loading similar papers…