RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

スポンサーリンク

概要

• 論文の詳細を見る

• 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-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic algorithms for SCP focusing mainly on contributions of mathematical programming techniques to heuristics, and illustrate their performance through experimental analysis.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Umetani Shunji

  University Of Electro-communications

• Yagiura Mutsunori

  Nagoya University

• Yagiura Mutsunori

  Nagoya Univ. Nagoya Jpn

関連論文

• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(the 50th Anniversary of the Operations Research Society of Japan)
• LAGRANGIAN-BASED COLUMN GENERATION FOR THE NODE CAPACITATED IN-TREE PACKING PROBLEM(SCOPE (Seminar on Computation and OPtimization for new Extensions))

スポンサーリンク