✦ LIBER ✦

A set-covering problem: the combinatorial-local approach and the branch and bound method

✍ Scribed by Yu.A. Zuev

Publisher: Elsevier Science
Year: 1979
Weight: 890 KB
Volume: 19
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(79)90050-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound network approach to t

A branch and bound network approach to the canonical constrained entropy problem

✍ J.R. Willems; A.V. Cabot 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 734 KB

A branch-and-price approach for the maxi

A branch-and-price approach for the maximum weight independent set problem

✍ Deepak Warrier; Wilbert E. Wilhelm; Jeffrey S. Warren; Illya V. Hicks 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

A generalization of the weighted set cov

A generalization of the weighted set covering problem

✍ Jian Yang; Joseph Y-T. Leung 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,

A branch and bound algorithm for the acy

A branch and bound algorithm for the acyclic subgraph problem

✍ R. Kaas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 612 KB

A recursive branch and bound algorithm f

A recursive branch and bound algorithm for the multidimensional knapsack problem

✍ Arne Thesen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

An upper bound for the zero-one knapsack

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 831 KB