Login / Signup

New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems.

Wei YuZhaohui LiuXiaoguang Bao
Published in: AAIM (2018)
Keyphrases
  • lp relaxation
  • linear programming
  • np complete
  • optimization problems
  • simulated annealing
  • linear program
  • minimum cost
  • network flow