Free Access
Issue
RAIRO-Oper. Res.
Volume 54, Number 3, May-June 2020
Page(s) 845 - 871
DOI https://doi.org/10.1051/ro/2019037
Published online 20 March 2020
  • R.M. Aiex, M.G.C. Resende and C.C. Ribeiro, Probability distribution of solution time in GRASP: An experimental investigation. J. Heurist. 8 (2002) 343–373. [CrossRef] [Google Scholar]
  • R.M. Aiex, M.G.C. Resende and C.C. Ribeiro, TTTPLOTS: A Perl program to create time-to-target plots. Optim. Lett. 1 (2007) 355–366. [Google Scholar]
  • C. Avanthay, A. Hertz and N. Zufferey, A variable neighborhood search for graph coloring. Eur. J. Oper. Res. 151 (2003) 379–388. [Google Scholar]
  • M.P. Bastos and C.C. Ribeiro, Reactive tabu search with path-relinking for the Steiner problem in graphs, In: Essays and Surveys in Metaheuristics edited by C.C. Ribeiro and P. Hansen. Springer, Boston (2002) 39–58. [CrossRef] [Google Scholar]
  • H. Bouziri and M. Jouini, A tabu search approach for the sum coloring problem. Electron. Notes Discrete Math. 36 (2010) 915–922. [CrossRef] [Google Scholar]
  • M. Chiarandini, I. Dumitrescu and T. Stützle, Stochastic local search algorithms for the graph colouring problem, In: Handbook of Approximation Algorithms and Metaheuristics, edited by T.F. Gonzalez Computer & Information Science Series. Chapman & Hall, Boca Raton (2007) 63.1–63.17. [Google Scholar]
  • P. Galinier and J.-K. Hao, Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3 (1999) 379–397. [Google Scholar]
  • F. Glover, Tabu search and adaptive memory programming – Advances, applications and challenges, In: Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies, edited by R.S. Barr, R.V. Helgason and J.L. Kennington, Springer, Boston (1997) 1–75. [Google Scholar]
  • J.-P. Hamiez and J.-K. Hao, Scatter search for graph coloring, In: Artificial Evolution, edited by P. Collet, C. Fonlupt, J.-K. Hao, E. Lutton and M. Schoenauer. Vol. 2310 of Lecture Notes in Computer Science. Springer, Berlin (2002) 168–179. [CrossRef] [Google Scholar]
  • A. Helmar and M. Chiarandini, A local search heuristic for chromatic sum, In: Proceedings of the 9th Metaheuristics International Conference, Udine, edited by L.D. Gaspero, A. Schaerf and T. Stützle (2011) 161–170. [Google Scholar]
  • A. Hertz and D. de Werra, Using tabu search techniques for graph coloring. Computing 39 (1987) 345–351. [CrossRef] [MathSciNet] [Google Scholar]
  • S.C. Ho and M. Gendreau, Path relinking for the vehicle routing problem. J. Heurist. 12 (2006) 55–72. [CrossRef] [Google Scholar]
  • H. Hoos and T. Stützle, Evaluation of Las Vegas algorithms – Pitfalls and remedies, In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, Madison, edited by G. Cooper and S. Moral (1998) 238–245. [Google Scholar]
  • R. Interian and C.C. Ribeiro, A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem. Int. Trans. Oper. Res. 24 (2017) 1307–1323. [Google Scholar]
  • K. Jansen, Complexity results for the optimum cost chromatic partition problem. Universität Trier, Mathematik/Informatik (1996) 96–41. [Google Scholar]
  • K. Jansen, The optimum cost chromatic partition problem, In: Algorithms and Complexity, edited by G. Bongiovanni, D. Bovet and G. Di Battista Vol. 1203 of Lecture Notes in Computer Science. Springer, Berlin (1997) 25–36. [CrossRef] [Google Scholar]
  • K. Jansen, Approximation results for the optimum cost chromatic partition problem. J. Algorithms 34 (2000) 54–89. [CrossRef] [Google Scholar]
  • Y. Jin, J.-P. Hamiez and J.-K. Hao, Algorithms for the minimum sum coloring problem: A review. Artif. Intell. Rev. 47 (2017) 367–394. [Google Scholar]
  • L.G. Kroon, A. Sen, H. Deng and A. Roy, The optimal cost chromatic partition problem for trees and interval graphs, In: Graph-Theoretic Concepts in Computer Science, edited by F. d’Amore, P. Franciosa and A. Marchetti-Spaccamela Vol. 1197 of Lecture Notes in Computer Science. Springer, Berlin (1997) 279–292. [CrossRef] [Google Scholar]
  • E. Kubicka and A.J. Schwenk, An introduction to chromatic sums. In Proceedings of the ACM Seventeenth Annual Computer Science Conference. ACM Press (1989) 39–45. [Google Scholar]
  • X. Lai and J.-K. Hao, Path relinking for the fixed spectrum frequency assignment problem. Expert Syst. Appl. 42 (2015) 4755–4767. [Google Scholar]
  • F.T. Leighton, A graph coloring algorithm for large scheduling problems. J. Res. Nat. Bureau Stand. 84 (1979) 489–506. [CrossRef] [Google Scholar]
  • E. Malaguti, M. Monaci and P. Toth, Models and heuristic algorithms for a weighted vertex coloring problem. J. Heurist. 15 (2009) 503–526. [CrossRef] [Google Scholar]
  • E. Malaguti and P. Toth, A survey on vertex coloring problems. Int. Trans. Oper. Res. 17 (2010) 1–34. [Google Scholar]
  • C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, Boston (1980). [Google Scholar]
  • M.G.C. Resende and C.C. Ribeiro, A GRASP with path-relinking for private virtual circuit routing. Networks 41 (2003) 104–114. [CrossRef] [MathSciNet] [Google Scholar]
  • M.G.C. Resende and C.C. Ribeiro, Greedy randomized adaptive search procedures: Advances and applications, In: Handbook of metaheuristics, edited by M. Gendreau and J.-Y. Potvin, 2nd edition. Springer, New York (2010) 293–319. [Google Scholar]
  • M.G.C. Resende and C.C. Ribeiro, Restart strategies for GRASP with path-relinking heuristics. Optim. Lett. 5 (2011) 467–478. [Google Scholar]
  • M.G.C. Resende and C.C. Ribeiro, Optimization by GRASP: Greedy Randomized Adaptive Search Procedures. Springer, Boston (2016). [Google Scholar]
  • M.G.C. Resende, C.C. Ribeiro, F. Glover and R. Martí, Scatter search and path-relinking: Fundamentals, advances, and applications, In: Handbook of metaheuristics, edited by M. Gendreau and J.-Y. Potvin, 2nd edition. Springer, New York (2010) 87–107. [CrossRef] [Google Scholar]
  • C.C. Ribeiro and M.G.C. Resende, Path-relinking intensification methods for stochastic local search algorithms. J. Heurist. 18 (2012) 193–214. [CrossRef] [Google Scholar]
  • C.C. Ribeiro and D.S. Vianna, A hybrid genetic algorithm for the phylogeny problem using path-relinking as a progressive crossover strategy. Int. Trans. Oper. Res. 16 (2009) 641–657. [Google Scholar]
  • A. Sen, H. Deng and S. Guha, On a graph partition problem with application to VLSI layout. Info. Proc. Lett. 43 (1992) 87–94. [CrossRef] [Google Scholar]
  • T. Stützle and H.H. Hoos, Analyzing the run-time behaviour of iterated local search for the tsp. In: III Metaheuristics International Conference, Angra dos Reis (1999) 449–453. [Google Scholar]
  • K. Supowit, Finding a maximum planar subset of a set of nets in a channel. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 6 (1987) 93–94. [CrossRef] [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.