✦ LIBER ✦

Activity selection games and the minimum-cut problem

✍ Scribed by Donald M. Topkis

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 717 KB
Volume: 13
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230130106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum cut separator problem

✍ Walid Ben-Ameur; Mohamed Didi Biha 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

Minimum cuts and related problems

✍ J. C. Picard; H. D. Ratliff 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 520 KB

The minimum feature subset selection pro

The minimum feature subset selection problem

✍ Bin Chen; Jiarong Hong; Yadong Wang 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 499 KB

An efficient algorithm for the minimum c

An efficient algorithm for the minimum capacity cut problem

✍ M. Padberg; G. Rinaldi 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 757 KB

Cardinality constrained minimum cut prob

Cardinality constrained minimum cut problems: complexity and algorithms

✍ Maurizio Bruglieri; Francesco Maffioli; Matthias Ehrgott 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 377 KB

In several applications the solutions of combinatorial optimization problems (COP) are required to satisfy an additional cardinality constraint, that is to contain a ÿxed number of elements. So far the family of (COP) with cardinality constraints has been little investigated. The present work tackle

The generalized minimum spanning tree pr

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views