The following publications are possibly variants of this publication:
- A GRASP/VND Heuristic for a Generalized Ring Star ProblemRodrigo Recoba, Franco Robledo, Pablo Romero, Omar Viera. hm 2016: 104-117 [doi]
- Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking ApproachEduardo A. Canale, Franco Robledo, Pablo Sartor, Luis Stábile. symmetry, 14(1):18, 2022. [doi]
- Max-Diversity Orthogonal Regrouping of MBA Students Using a GRASP/VND HeuristicMatías Banchero, Franco Robledo, Pablo Romero, Pablo Sartor, Camilo Servetti. icvns 2021: 58-70 [doi]
- A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time WindowsLucía Barrero, Franco Robledo, Pablo Romero, Rodrigo Viera. icvns 2021: 152-165 [doi]
- A Fast Genetic Algorithm for the Max Cut-Clique ProblemGiovanna Fortez, Franco Robledo, Pablo Romero, Omar Viera. mod 2020: 528-539 [doi]
- Complexity and heuristics for the weighted max cut-clique problemMathias Bourel, Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Luis Stábile. itor, 29(2):908-928, 2022. [doi]
- Complexity and Heuristics for the Max Cut-Clique ProblemMathias Bourel, Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Luis Stábile. icvns 2019: 28-40 [doi]
- A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile ReliabilitySebastián Laborde, Franco Robledo, Pablo Romero, Omar Viera. icvns 2021: 43-57 [doi]