Login / Signup

New formulations and branch-and-cut procedures for the longest induced path problem.

Ruslán G. MarzoRafael A. MeloCelso C. RibeiroMarcio Costa Santos
Published in: Comput. Oper. Res. (2022)
Keyphrases
  • three dimensional
  • upper bound
  • shortest path
  • databases
  • data mining
  • learning algorithm
  • bayesian networks
  • optimization methods
  • endpoints
  • minimum cost
  • path selection