An Algorithm for Choosing, Ordering a New Criteria of a Bi-Objective Flow Problem

Pubblicato online: 01 mar 2021

Pagine: 11 - 26

Ricevuto: 28 feb 2020

Accettato: 30 set 2020

DOI: https://doi.org/10.2478/fcds-2021-0002

Parole chiave

Bi-objective minimum cost flow problem, Network flows, Network mathematical programming, Efficient extreme point

© 2021 Salima Nait Belkacem, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.