Login / Signup

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.

Timo GschwindStefan IrnichFabio FuriniRoberto Wolfler Calvo
Published in: INFORMS J. Comput. (2021)
Keyphrases
  • main contribution
  • genetic algorithm
  • theoretical framework
  • neural network
  • machine learning
  • lightweight
  • shortest path
  • maximal cliques