Login / Signup

Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs.

Niels GrüttemeierPhilipp Heinrich KeßlerChristian KomusiewiczFrank Sommer
Published in: CoRR (2022)
Keyphrases
  • branch and bound algorithm
  • lower bound
  • randomly generated
  • set covering problem
  • np hard
  • branch and bound
  • upper bound
  • linear programming
  • combinatorial optimization
  • combinatorial problems
  • maximum clique