RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM

Article English OPEN
Umetani, Shunji ; Yagiura, Mutsunori ; 柳浦, 睦憲 (2007)
  • Publisher: 日本オペレーションズ・リサーチ学会
  • Journal: Journal of the Operations Research Society of Japan, volume 50, issue 4, pages 350-375 (issn: 0453-4514)
  • Subject: heuristic algorithm | Combinatorial optimization | Lagrangian relaxation | set covering problem | linear programming | subgradient method
    acm: ComputerApplications_COMPUTERSINOTHERSYSTEMS | MathematicsofComputing_DISCRETEMATHEMATICS

The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and... View more
Share - Bookmark

  • Download from
    JAIRO via JAIRO (Article, 2007)
  • Cite this publication