Login / Signup

A Fast Cutting-Plane Algorithm for Optimal Coalescing.

Daniel GrundSebastian Hack
Published in: CC (2007)
Keyphrases
  • cutting plane algorithm
  • cutting plane
  • integer programming
  • optimal solution
  • routing problem
  • worst case
  • maximum margin
  • computational complexity
  • lower bound
  • upper bound
  • markov random field
  • simulated annealing