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

Published Online: Mar 01, 2021

Page range: 11 - 26

Received: Feb 28, 2020

Accepted: Sep 30, 2020

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

Keywords

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.