RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM
- Publisher: 日本オペレーションズ・リサーチ学会
Journal of the Operations Research Society of Japan,
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...