Modified and Improved Algorithm for Finding a Median Path with a Specific Length (<i>ℓ</i>) for a Tree Network
The median path problem (min-sum criterion) is a common problem in graph theory and tree networks. This problem is open to study because its applications are growing and extending in different fields, such as providing insight for decision-makers when selecting the optimal location for non-emergency...
Main Authors: | Abdallah Aboutahoun, Salem Mahdi, Mahmoud El-Alem, Mohamed ALrashidi |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-08-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/16/3585 |
Similar Items
-
The extensive 1-median problem with radius on networks
by: Tran Hoai Ngoc Nhan, et al.
Published: (2023-10-01) -
2-Median Problem on a Tree with Grey Parameters
by: Jafar Fathali, et al.
Published: (2023-12-01) -
Inverse of Backup 2-Median Problems with Variable Edge Lengths and Vertex Weight on Trees and Variable Coordinates on the Plane
by: Morteza Nazari, et al.
Published: (2018-10-01) -
Search tree-based approach for the p-median problem using the ant colony optimization algorithm
by: Gabriel Bodnariuc, et al.
Published: (2014-03-01) -
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem
by: Agostinho Agra, et al.
Published: (2024-01-01)