Inproceedings,

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

, , and .
AAIM, volume 11343 of Lecture Notes in Computer Science, page 221-232. Springer, (2018)

Meta data

Tags

Users

  • @dblp

Comments and Reviews