Requiring Connectivity in the Set Covering Problem-Reference-Cited by-同舟云学术

Requiring Connectivity in the Set Covering Problem

Published:2005-02 Issue:1 Volume:9 Page:35-47
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Cerdeira J. Orestes,Pinto Leonor S.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-005-5482-5.pdf

Reference23 articles.

1. E. Balas and S.M. Ng ?On the set covering polytope: I. all facets with coefficients in {0,1,2},? Mathematical Programming, vol. 43, pp. 57?69,1989a.

2. E. Balas and S.M. Ng ?On the set covering polytope: II. lifting the facets with coefficients in {0,1,2},? Mathematical Programming, vol. 45, pp. 1?20, 1989b.

3. R.A. Briers ?Incorporating connectivity into reserve selection procedures,? Biological Conservation, vol. 103, pp. 77?83, 2002.

4. D.M. Debinski and R.D. Holt ?A survey and overviewof habitat fragmentation,? Conservation Biology, vol. 14, pp. 342?355, 2000.

5. G. Cornuéjols and A. Sassano ?On the 0,1 facets of the set covering polytope,? Mathematical Programming, vol. 43, pp. 45?55, 1989.

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

1. Operations research applicability in spatial conservation planning;Journal of Environmental Management;2022-08

2. Exact Zoning Optimization Model for Marine Spatial Planning (MSP);Frontiers in Marine Science;2021-11-18

3. Optimal design of compact and functionally contiguous conservation management areas;European Journal of Operational Research;2016-06

4. Improved Approximation Algorithms for Relay Placement;ACM Transactions on Algorithms;2016-02-12

5. Connected Set-Cover and Group Steiner Tree;Encyclopedia of Algorithms;2016