Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Foundations of Computing and Decision Sciences
Volume 48 (2023): Issue 3 (September 2023)
Open Access
New Algorithm Permitting the Construction of an Effective Spanning Tree
Salima Nait Belkacem
Salima Nait Belkacem
and
Moncef Abbas
Moncef Abbas
| Oct 05, 2023
Foundations of Computing and Decision Sciences
Volume 48 (2023): Issue 3 (September 2023)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Oct 05, 2023
Page range:
313 - 329
Received:
Jun 12, 2022
Accepted:
Mar 10, 2023
DOI:
https://doi.org/10.2478/fcds-2023-0012
Keywords
Bi-objective minimum cost flow problem
,
Network flows
,
Linear programming
,
Minimum spanning tree
,
Efficient extreme point
© 2023 Salima Nait Belkacem et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.