A note on some computationally difficult set covering problems-Reference-Cited by-同舟云学术

A note on some computationally difficult set covering problems

Published:1980-12 Issue:1 Volume:18 Page:138-145
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Avis Davis

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01588309.pdf

Reference10 articles.

1. V. Chvátal, “Hard knapsack problems”,Journal of Operations Research, to appear.

2. V. Chvátal, “A greedy heuristic for the set covering problem”, Publication No. 284, Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, Montréal (1978).

3. V. Chvátal, “Determining the stability number of a graph”,SIAM Journal on Computing 6 (1977) 643–662.

4. S.A. Cook and R.A. Reckhow, “On the Lengths of Proofs in the Propositional Calculus”,Proceedings of 6th Annual ACM Symposium on Theory of Computing (1974) 135–148.

5. R. Fulkerson, G. Nemhauser and L. Trotter, “Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems”,Mathematical Programming Study 2 (1974) 72–81.

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the non-unicost set covering problem by using cuckoo search and black hole optimization;Natural Computing;2017-01-11

2. References;Integer and Combinatorial Optimization;2014-08-22

3. A set covering approach for multi-depot train driver scheduling;Journal of Combinatorial Optimization;2013-04-07

4. Measuring instance difficulty for combinatorial optimization problems;Computers & Operations Research;2012-05

5. Solving large Steiner Triple Covering Problems;Operations Research Letters;2011-03