Login / Signup

Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach.

Eduardo A. CanaleFranco RobledoPablo SartorLuis Stábile
Published in: Symmetry (2022)
Keyphrases
  • objective function
  • tabu search
  • mathematical model
  • lower bound
  • metaheuristic
  • global optimization
  • path relinking