An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
RAIRO-Oper. Res., 49 1 (2015) 143-160
Published online: 2014-12-17
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
1 (2025)
https://doi.org/10.1007/978-3-319-07153-4_49-2
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms
Minh Hieu Nguyen, Mourad Baiou and Viet Hung NguyenDiscrete Applied Mathematics 365 71 (2025)
https://doi.org/10.1016/j.dam.2024.12.026
199 (2024)
https://doi.org/10.1109/ICAI63388.2024.10851587
Generalized nash fairness solutions for bi‐objective minimization problems
Minh Hieu Nguyen, Mourad Baiou, Viet Hung Nguyen and Thi Quynh Trang VoNetworks 83 (1) 83 (2024)
https://doi.org/10.1002/net.22182
On solving bi-objective constrained minimum spanning tree problems
Iago A. Carvalho and Amadeu A. CocoJournal of Global Optimization 87 (1) 301 (2023)
https://doi.org/10.1007/s10898-023-01295-8
A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem
V. Prem Prakash, C. Patvardhan and Anand SrivastavEngineering Applications of Artificial Intelligence 87 103237 (2020)
https://doi.org/10.1016/j.engappai.2019.103237
Bi-objective methods for road network problems with disruptions and connecting requirements
Yipeng Huang, Andréa Cynthia Santos and Christophe DuhamelJournal of the Operational Research Society 71 (12) 1959 (2020)
https://doi.org/10.1080/01605682.2019.1639479
Novel Heuristics for the Euclidean Leaf-Constrained Minimum Spanning Tree Problem
V. Prem Prakash and C. PatvardhanSN Computer Science 1 (2) (2020)
https://doi.org/10.1007/s42979-020-0120-y
Modeling and solving the multi-period disruptions scheduling problem on urban networks
Amadeu A. Coco, Christophe Duhamel and Andréa Cynthia SantosAnnals of Operations Research 285 (1-2) 427 (2020)
https://doi.org/10.1007/s10479-019-03248-5
Handbook of Heuristics
Andréa Cynthia Santos, Christophe Duhamel and Rafael AndradeHandbook of Heuristics 1307 (2018)
https://doi.org/10.1007/978-3-319-07124-4_49
Handbook of Heuristics
Andréa Cynthia Santos, Christophe Duhamel and Rafael AndradeHandbook of Heuristics 1 (2016)
https://doi.org/10.1007/978-3-319-07153-4_49-1