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

Data publikacji: 01 mar 2021

Zakres stron: 11 - 26

Otrzymano: 28 lut 2020

Przyjęty: 30 wrz 2020

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

Słowa kluczowe

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.