EDP Sciences logo
Subscriber Authentication Point
Sciengine logo
Search
Menu
All issues Volume 59 / No 6 (November-December 2025) RAIRO-Oper. Res., 59 6 (2025) 3969-3998 References
Open Access
Issue
RAIRO-Oper. Res.
Volume 59, Number 6, November-December 2025
Page(s) 3969 - 3998
DOI https://doi.org/10.1051/ro/2025008
Published online 28 January 2026
  • A. Abdalla and N. Deo, Random-tree diameter and the diameter-constrained MST. Int. J. Comput. Math. 79 (2002) 651–663. [Google Scholar]
  • N. Achuthan, L. Caccetta, P. Caccetta and J. Geelen, Computational methods for the diameter restricted minimum weight spanning tree problem. Australas. J. Comb. 10 (1994) 51–71. [Google Scholar]
  • K. Bala, K. Petropoulos and T.E. Stern, Multicasting in a linear lightwave network, in IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings. Vol. 3. IEEE Computer Society Press (1993) 1350–1358. [Google Scholar]
  • J.E. Beasley, OR-Library: Euclidean Steiner problem. http://people.brunel.ac.uk/-mastjjb/jeb/info.html (2005). [Google Scholar]
  • T.T.H. Binh, R.I. McKay, N.X. Hoai and N.D. Nghia, New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem, in Proceedings of the 11th Annual Conference On Genetic and Evolutionary Computation GECCO '09. ACM Press, New York, NY, USA (2009) 373. [Google Scholar]
  • A. Bookstein and S.T. Klein, Compression of correlated bit-vectors. Inf. Syst. 16 (1991) 387–400. [Google Scholar]
  • M. Chiarandini and T. Stützle, An application of iterated local search to graph coloring, in Proceedings of the Computational Symposium on Graph Coloring and its Generalizations. Ithaca, New York, NY, USA (2002). [Google Scholar]
  • D.M. Da Silva, Y.A.M. Frota and A. Subramanian, Uma heurística para o problema de roteamento de veículos com múltiplas viagens, in Congreso Latino-Iberoamericano Investigación Operativa (2012) 1880–1891. [Google Scholar]
  • M.P. de Aragão, E. Uchoa and R.F. Werneck, Dual heuristics on the exact solution of large steiner problems. Electron. Notes Discrete Math. 7 (2001) 150–153. [Google Scholar]
  • X. Dong, H. Huang and P. Chen, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Comput. Oper. Res. 36 (2009) 1664–1669. [CrossRef] [MathSciNet] [Google Scholar]
  • M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. Mathematical Sciences Series. W.H. Freeman (1979). [Google Scholar]
  • F. Glover and G.A. Kochenberger, editors. Handbook of Metaheuristics. Vol. 57 of International Series in Operations Research & Management Science. Springer US, Boston, MA (2003). [Google Scholar]
  • L. Gouveia and T. Magnanti, Network flow models for designing diameter-constrained minimum spanning and steiner trees. Networks 41 (2003) 159–173. [Google Scholar]
  • L. Gouveia, A. Paias and D. Sharma, Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. J. Heuristics 17 (2011) 23–37. [Google Scholar]
  • L. Gouveia, L. Simonetti and E. Uchoa, Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Math. Program. 128 (2011) 123–148. [Google Scholar]
  • M. Gruber and G.R. Raidl, A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem, in Proceedings of 2nd International Network Optimization Conference, edited by L. Gouveia and C. Mourão (2005) 178–185. [Google Scholar]
  • M. Gruber and G.R. Raidl, Variable neighborhood search for the bounded diameter minimum spanning tree problem, in Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, edited by P. Hansen, N. Mladenović, J.A.M. Pérez, B.M. Batista and J.M. Moreno-Vega. (2005). [Google Scholar]
  • M. Gruber and G.R. Raidl, (Meta-) Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. Vol. 10. Springer US (2009) 209–229. [Google Scholar]
  • M. Gruber, J. van Hemert and G.R. Raidl, Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO, in Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation GECCO '06. ACM Press, New York, NY, USA (2006) 1187. [Google Scholar]
  • G.Y. Handler, Minimax location of a facility in an undirected tree graph. Transp. Sci. 7 (1973) 287–293. [Google Scholar]
  • P. Hansen and N. Mladenović, Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130 (2001) 449–467. [Google Scholar]
  • P. Hansen and N. Mladenović, Variable Neighborhood Search, in Search Methodologies. Springer US, Boston, MA (2005) 211–238. [Google Scholar]
  • B.A. Julstrom, Encoding bounded-diameter spanning trees with permutations and with random keys, in Genetic and Evolutionary Computation GECCO 2004 (2004) 1272–1281. [Google Scholar]
  • B.A. Julstrom, Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM J. Exp. Algorithmics 14 (2009) 1–14. [Google Scholar]
  • B.A. Julstrom and G.R. Raidl, A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem, in 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Desgn of Representations (2003) 2–7. [Google Scholar]
  • W. Liu, Y. Gong, W. Chen, Z. Liu, H. Wang and J. Zhang, Coordinated charging scheduling of electric vehicles: a mixed-variable differential evolution approach. IEEE Trans. Intell. Transp. Syst. 21 (2020) 5094–5109. [CrossRef] [Google Scholar]
  • M. López-Ibáñez, J. Dubois-Lacoste, L. Pérez Cáceres, M. Birattari and T. Stützle, The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3 (2016) 43–58. [MathSciNet] [Google Scholar]
  • H.R. Lourenço, O.C. Martin and T. Stützle, Iterated local search, in Handbook of Metaheuristics. Kluwer Academic Publishers, Boston (2003) 320–353. [Google Scholar]
  • A. Lucena, C.C. Ribeiro and A.C. Santos, A hybrid heuristic for the diameter constrained minimum spanning tree problem. J. Global Optim. 46 (2010) 363–381. [Google Scholar]
  • N. Maculan, The steiner problem in graphs, in Annals of Discrete Mathematics. Vol. 31 of North-Holland Mathematics Studies, edited by S. Martello, G. Laporte, M. Minoux and C.C. Ribeiro. North-Holland (1987) 185–212. [Google Scholar]
  • L.C. Martins, R.G.S. Pinheiro, F. Protti and L.S. Ochi, A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem. Expert Syst. App. 42 (2015) 8947–8955. [Google Scholar]
  • N. Mladenović and P. Hansen, Variable neighborhood search. Comput. Oper. Res. 24 (1997) 1097–1100. [Google Scholar]
  • C. Patvardhan and V.P. Prakash, Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem. Expert Syst. 38 (2021) e12610. [Google Scholar]
  • C. Patvardhan, V.P. Prakash and A. Srivastav, Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem. Informatica 39 (2015) 281–292. [Google Scholar]
  • P.H.V. Penna, A. Subramanian and L.S. Ochi, An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J. Heuristics 19 (2013) 201–232. [Google Scholar]
  • R.C. Prim, Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36 (1957) 1389–1401. [NASA ADS] [CrossRef] [Google Scholar]
  • G.R. Raidl and B.A. Julstrom, Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem, in Proceedings of the 2003 ACM symposium on Applied computing SAC '03. ACM Press, New York, NY, USA (2003) 747. [Google Scholar]
  • G.R. Raidl and B.A. Julstrom, Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. 7 (2003) 225–239. [Google Scholar]
  • K. Raymond, A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7 (1989) 61–77. [Google Scholar]
  • A.C. Santos, A. Lucena and C.C. Ribeiro, Solving diameter constrained minimum spanning tree problems in dense graphs, in Experimental and Efficient Algorithms, edited by C.C. Ribeiro and S.L. Martins. Springer Berlin Heidelberg (2004) 458–467. [Google Scholar]
  • A. Singh and A.K. Gupta, Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Comput. 11 (2007) 911–921. [Google Scholar]
  • K. Singh and S. Sundar, A heuristic for the bounded diameter minimum spanning tree problem, in Proceedings of the 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence ISMSI '18. ACM Press, New York, NY, USA (2018) 84–88. [Google Scholar]
  • M.J.F. Souza, I.M. Coelho, S. Ribas, H.G. Santos and L.H.C. Merschmann, A hybrid heuristic algorithm for the open-pit-mining operational planning problem. Eur. J. Oper. Res. 207 (2010) 1041–1051. [Google Scholar]
  • W. Steitz, New heuristic approaches for the bounded-diameter minimum spanning tree problem. INFORMS J. Comput. 27 (2015) 151–163. [Google Scholar]
  • A. Subramanian, L.M.A. Drummond, C. Bentes, L.S. Ochi and R. Farias, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37 (2010) 1899–1911. [Google Scholar]
  • J.A. Torkestani, An adaptive heuristic to the bounded-diameter minimum spanning tree problem. Soft Computing 16 (2012) 1977–1988. [Google Scholar]
  • F. Zhao, X. He and L. Wang, A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem. IEEE Trans. Cybern. 51 (2021) 5291–5303. [Google Scholar]
  • F. Zhao, R. Ma and L. Wang, A self-learning discrete jaya algorithm for multiobjective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system. IEEE Trans. Cybern. 52 (2021) 12675–12686. [Google Scholar]
  • F. Zhao, L. Zhang, J. Cao and J. Tang, A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Comput. Ind. Eng. 153 (2021) 107082. [Google Scholar]
  • S. Zhou, L. Xing, X. Zheng, N. Du, L. Wang and Q. Zhang, A self-adaptive differential evolution algorithm for scheduling a single batch-processing machine with arbitrary job sizes and release times. IEEE Trans. Cybern. 51 (2021) 1430–1442. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.