References
- B. Mukherjee. WDM optical communication networks: progress and challenges. IEEE Journal on Selected Areas in Communications, 18 (10): 1810–1824, 2000. doi: 10.1109/49.887904
- E. Yetginer and E. Karasan. Regenerator Placement and Traffic Engineering with Restoration in GMPLS Networks. Photonic Network Communications, 6 (2): 139–149, 2003. doi: 10.1023/A:1024731113866
- L. Gouveia, P. Patricio, A.F. De Sousa, and R. Valadas. MPLS over WDM network design with packet level QoS constraints based on ILP models. In INFO-COM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, volume 1, pages 576–586 vol.1, March 2003.
- S. Chen and S. Raghavan. The Regenerator Location Problem. In Proceedings of the 2007 International Network Optimization Conference (INOC 2007), 2007.
- S. Chen, I. Ljubić, and S. Raghavan. The regenerator location problem. Networks, 55 (3): 205–220, 2010.
- A. Duarte, R. Martí, M.G.C. Resende, and R.M.A. Silva. Improved heuristics for the regenerator location problem. International Transactions in Operational Research, 21 (4): 541–558, 2014. doi: 10.1111/itor.12085
- J. Sánchez-Oro and A. Duarte. Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem, volume 9422, pages 322–331. Springer, 2015.
- S. Chen, I. Ljubić, and S. Raghavan. The generalized regenerator location problem. In Proceedings of the 2009 International Network Optimization Conference (INOC 2009), 2009.
- M. Flammini, A. Machetti, G. Monaco, L. Moscardelli, and S. Zaks. On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Transactions on Networking, 19 (2): 498–511, 2011. doi: 10.1109/TNET.2010.2068309
- S. Chen, I. Ljubić, and S. Raghavan. The Generalized Regenerator Location Problem. INFORMS Journal on Computing, 27 (2): 204–220, 2015. doi: 10.1287/ijoc.2014.0621
- T.A. Feo and M.G.C. Resende. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research, 42 (5): 860–878, 1994. doi: 10.1287/opre.42.5.860
- T.A Feo and M.G.C. Resende. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. Oper. Res. Lett., 8 (2): 67–71, 1989. doi: 10.1016/0167-6377(89)90002-3
- M.G.C. Resende and C.C. Ribeiro. Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications. In M. Gendreau and J.Y. Potvin, editors, Handbook of Metaheuristics, volume 146 of International Series in Operations Research & Management Science, pages 283–319. Springer US, 2010.
- M.G.C. Resende and C.C. Ribeiro. GRASP: Greedy Randomized Adaptive Search Procedures. In E.K. Burke and G. Kendall, editors, Search Methodologies, pages 287–312. Springer US, 2014.
- V. Campos, R. Martí, J. Sánchez-Oro, and A. Duarte. GRASP with path relinking for the orienteering problem. Journal of the Operational Research Society, 65 (12): 1800–1813, 2014. doi: 10.1057/jors.2013.156
- A. Duarte, J. Sánchez-Oro, M.G.C. Resende, F. Glover, and R. Martí. Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Information Sciences, 296 (1): 46–60, 2015. doi: 10.1016/j.ins.2014.10.010
- J. Sánchez-Oro, J.J. Pantrigo, and A. Duarte. Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem. Computers & Operations Research, 52, Part B: 209–219, 2014. doi: 10.1016/j.cor.2013.11.008