New Algorithm Permitting the Construction of an Effective Spanning Tree

Département de Recherche Opérationnelle, Faculté de Mathématiques, Université des sciences et de la Technologie Houari Boumedienne, Bab-Ezzouar (Algérie). Works at Faculté des Hydrocarbures et de la Chimie, Université M’Hamed Bougara, Boumerdes, Algérie

Moncef Abbas

USTHB, Faculté des Mathématiques, / Laboratoire « AMCD&RO »

Metrics

Articles in this issue

DOI: https://doi.org/10.2478/fcds-2023-0012 | Journal eISSN: 2300-3405 | Journal ISSN: 0867-6356

Journal RSS Feed

Language: English

Page range: 313 - 329

Submitted on: Jun 12, 2022

Accepted on: Mar 10, 2023

Published on: Oct 5, 2023

Published by: Poznan University of Technology

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

Bi-objective minimum cost flow problem,

Network flows,

Linear programming,

Minimum spanning tree,

Efficient extreme point

Related subjects:

Computer sciences,

Artificial intelligence,

Software development

© 2023 Salima Nait Belkacem, Moncef Abbas, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Volume 48 (2023): Issue 3 (September 2023)