• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems.

Paul SwobodaJan KuskeBogdan Savchynskyy
Published in: CVPR (2017)
Keyphrases
  • combinatorial problems
  • constraint programming
  • upper bound
  • constraint satisfaction
  • graph coloring
  • combinatorial optimization
  • lower bound
  • constraint satisfaction problems
  • metaheuristic
  • specific problems