Skip to main content

A Sequential Network-Based Approach for the Multiobjective Network Flow Problem with Preemptive Priorities

  • Chapter

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 432))

Abstract

This paper presents a sequential approach for the problem of getting an optimal solution to the multiobjective network flow problem with preemptive priorities. This approach considers a priority every time, while maintaining through the sequence the network structure. This allows to use in each iteration of the process any efficient network-based algorithm for the single objective minimum cost flow problem.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. P. Bertsekas, Linear Network Optimization. Algorithms and Codes. MIT Press, Cambridge, MA (1991).

    Google Scholar 

  2. H. I. Calvete and P. M. Mateo, An Approach for the Network Flow Problem with Multiple Objectives. To appear in Computers and Operations Research.

    Google Scholar 

  3. H. I. Calvete and P. M. Mateo, PGRIDGEN, una modificación del generador de redes GRIDGEN. Publi. del Seminario García Galdeano, Serie II, sección 1, 1, 1–11 (1994).

    Google Scholar 

  4. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton University Press, Princeton, NJ (1962).

    Google Scholar 

  5. D. Klingman and J. Mote, Solution Approaches for Network Flow Problems with Multiple Criteria. Advances in Management Studies, 1 (1), 1–30 (1982).

    Google Scholar 

  6. E. Lawler, Combinatorial Optimization: Networks and Matroids. Holt, Reinhart and Winston, New York (1976).

    Google Scholar 

  7. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization. Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ (1982).

    Google Scholar 

  8. P. S. Pulat, F. Huarng and H. Lee, Efficient Solutions for the Bicriteria Network Flow Problem. Computers and Operations Research, 19 (7), 649–655 (1992).

    Article  Google Scholar 

  9. M. Zeleny, Multiple Criteria Decision Making. McGraw-Hill, New York (1982).

    Google Scholar 

  10. P. L. Yu and M. Zeleny, The Set of All Nondominated Solutions in Linear Cases and a Multicriteria Simplex Method. J. of Mathematical Analysis and Applications, 49, 430–468 (1975).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Calvete, H.I., Mateo, P.M. (1996). A Sequential Network-Based Approach for the Multiobjective Network Flow Problem with Preemptive Priorities. In: Tamiz, M. (eds) Multi-Objective Programming and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87561-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-87561-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60662-8

  • Online ISBN: 978-3-642-87561-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics