|
NAGOYA Repository >
D500 情報科学研究科 >
D500a 学術雑誌掲載論文 >
1.査読済資料 >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2237/11724
|
| Title: | RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM |
| Authors: |
Umetani, Shunji 
Yagiura, Mutsunori
柳浦, 睦憲
|
| Keywords: | Combinatorial optimization
set covering problem
linear programming
Lagrangian relaxation
subgradient method
heuristic algorithm |
| Issue Date: | Dec-2007 |
| Publisher: | 日本オペレーションズ・リサーチ学会 |
| Citation: | Journal of the Operations Research Society of Japan, v.50, n.4, 2007, p.350-375 |
| Abstract: | 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. |
| URI: | http://hdl.handle.net/2237/11724
http://www.orsj.or.jp/~oldweb/e-Library/50-4-350-375.pdf |
| ISSN: | 0453-4514 |
| Appears in Collections: | 1.査読済資料
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
