References
- Ahuja R K., Magnanti T L., Orlin J B., Network flows: Theory, algorithm, and applications. Prentice-Englewood Cliffs, 1993. .
- Cunningham W H., A network simplex method, Mathematical Programming, 11, 1976, 105-116.
- Eusébio A., Figueira J R., Ehrgott M., On finding representative non-dominated points for the bi objective integer network flow problems, Computers & Operations Research, 48, 2014, 1-10.
- Geoffrion A.M., ‘’Proper efficiency and the theory of vector maximization‘’, Journal of Mathematical Analysis and Application, 22, 1968, 618-630.
- Hamacher H W., Pedersen C R., Ruzika S., Multiple objective minimum cost flow problems: a review, European Journal of Operational Research, 176, 2007, 1404-1422.
- Lee H., Pulat S., Bi criteria network flow problems: continuous case, European Journal of Operational Research, 51, 1991, 119-126
- Lee H., Pulat S., Bicriteria network flow problems; Integer case, European Journal of Operational Research, 66, 1993, 1488-157.
- Nait Belkacem S., An Algorithm for Choosing Ordering a New Criteria of a Bi Objective Flow Problem, Foundations of Computing and Decision Sciences, 46, 2021, 11-26. DOI: 10.2478/fcds-2021-0002.
- Nait Belkacem S., Contribution à la Résolution du Problème de Flot Multi Objectif URI, Mémoire de Magister, Mathématique, Université des Sciences et Technologie Houari Boumedienne Algérie, 2007, 81. http://hdl.net/123456789/3195.
- Raith A., Ehrgott M., A two-phase algorithm for the bi objective integer minimum cost flow problem, Computers and Operations Research, 36, 2009, 1945-1954.
- Sedeno-Noda A., Gonzalez-Martin C., An algorithm for the bi-objective integer minimum cost flow problem, Computers and Operations Research, 28, 2001, 139-156.
- Sedeno-Noda A., Gonzalez-Martin C., The bi-objective minimum cost flow problem, European Journal of Operational Research, 124, 2000, 591-600