Issue
RAIRO-Oper. Res.
Volume 53, Number 5, November-December 2019
Operations Research Applications in Industry
Page(s) 1513 - 1528
DOI https://doi.org/10.1051/ro/2018072
Published online 08 October 2019
  • R. Aiex, M.G.C. Resende and C.C. Ribeiro, Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8 (2002) 343–373. [CrossRef] [Google Scholar]
  • R. Aiex, M.G.C. Resende and C.C. Ribeiro, TTT-plots: a perl program to create time-to-target plots. Optim. Lett. 1 (2007) 355–366. [CrossRef] [Google Scholar]
  • S. Antonakopoulos and L. Zhang, Heuristics for fiber installation in optical network optimization. In: Proceedings of 2007 IEEE Global Telecommunications Conference. Washington, USA (2007) 2342–2347. [Google Scholar]
  • P. Avella, S. Mattia and A. Sassano, Metric inequalities and the network loading problem. Dis. Optim. 4 (2007) 103–114. [CrossRef] [Google Scholar]
  • J.C. Bean, Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 2 (1994) 154–160. [CrossRef] [Google Scholar]
  • D. Bienstock, S. Chopra, O. Günlük and C. Tsai, Minimum cost capacity installation for multicommodity network flows. Math. Prog. 81 (1998) 177–199. [Google Scholar]
  • J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. Macmillan, London (1976). [CrossRef] [Google Scholar]
  • J.S. Choi, N. Golmie, F. Lapeyrere, F. Mouveaux and D. Su, A functional classification of routing and wavelength assignment schemes in DWDM networks: static case. In: Proceedings of the 7th International Conference on Optical Communication and Networks, Paris (2000) 1109–1115. [Google Scholar]
  • Cisco. Introduction to DWDM technology. Technical Report. Cisco Systems Inc., San Jose, CA (2001). [Google Scholar]
  • E.W. Dijkstra, A note on two problems in connection with graphs. Numer. Math. 1 (1959) 269–271. [Google Scholar]
  • A. Dutta, N. Dutta, M. Fujiwara and W.D.M. Technologies, Optical Networks. Elsevier, Amsterdam (2004). [Google Scholar]
  • A. Frangioni and B. Gendron, 0–1 reformulations of the multicommodity capacitated network design problem. Dis. Appl. Math. 157 (2009) 1229–1241. [CrossRef] [Google Scholar]
  • Y. Frota, N. Maculan, T.F. Noronha and C.C. Ribeiro, A branch-and-cut algorithm for partition coloring. Networks 55 (2010) 194–204. [Google Scholar]
  • P. Galinier and A. Hertz, A survey of local search methods for graph coloring. Comput. Oper. Res. 33 (2006) 2547–2562. [Google Scholar]
  • M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1990). [Google Scholar]
  • J.F. Gonçalves and M.G.C. Resende, Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17 (2011) 487–525. [CrossRef] [Google Scholar]
  • N. Goulart, L.G.S. Dias, S.R. de Souza and T.F. Noronha, Biased random-key genetic algorithm for fiber installation in optical network optimization. In: IEEE Congress on Evolutionary Computation, New Orleans (2011) 2267–2271. [Google Scholar]
  • K. Holmberg and D. Yuan, A lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48 (2000) 461–481. [Google Scholar]
  • H.R. Lourenço, O.C. Martin and T. Stützle, Iterated local search. In: Handbook of Metaheuristics, edited by F. Glover, G. Kochenberger and F.S. Hillier, 1st edition. Springer (2003) 320–353. [CrossRef] [Google Scholar]
  • H.R. Lourenço, O.C. Martin and T. Stützle, Iterated Local Search: Framework and Applications, 2nd edition. Springer US, Boston, MA (2010) 363–397. [Google Scholar]
  • M. Matsumoto and T. Nishimura, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8 (1998) 3–30. [Google Scholar]
  • T.F. Noronha, M.G.C. Resende and C.C. Ribeiro, A biased random-key genetic algorithm for routing and wavelength assignment. J. Global Optim. 50 (2011) 503–518. [CrossRef] [Google Scholar]
  • T.F. Noronha, M.G.C. Resende and C.C. Ribeiro, System for Routing and Wavelength Assignment in Wavelength Division Multiplexing Optical Networks (2014). US8693871B2. [Google Scholar]
  • T.F. Noronha and C.C. Ribeiro, Routing and wavelength assignment by partition coloring. Eur. J. Oper. Res. 171 (2006) 797–810. [Google Scholar]
  • S. Orlowski, R. Wessäly, M. Pióro and A. Tomaszewski, Sndlib 1.0 – survivable network design library. Networks 55 (2010) 276–286. [Google Scholar]
  • R. Read, The number of fc-colored graphs on labelled nodes. Can. J. Math. 12 (1960) 410–414. [CrossRef] [Google Scholar]
  • C.C. Ribeiro, I. Rosseti and R. Vallejos, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. J. Global Optim. 54 (2012) 405–429. [CrossRef] [Google Scholar]
  • C.C. Ribeiro, I. Rosseti and R. Vallejos, TTTplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms. Optim. Lett. 9 (2014) 601–614. [CrossRef] [Google Scholar]
  • W. Spears and K. De Jong, On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms. San Mateo, CA (1991) 230–236. [Google Scholar]
  • H. Zang, J.P. Jue and B. Mukherjee, A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Opt. Netw. Mag. 1 (2000) 47–60. [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.