✦ LIBER ✦

Constrained matroidal bottleneck problems

✍ Scribed by Igor Averbakh; Oded Berman; Abraham P. Punnen

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 894 KB
Volume: 63
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00114-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A multiply constrained matroid optimizat

A multiply constrained matroid optimization problem

✍ F. Rendl; M. Leclerc 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 687 KB

We consider the problem of finding a minimum weight basis in a matroid satisfying additional conditions which can be described as follows: each element of the matroid is assigned a colour and feasible bases can use at most a prescribed number of elements from each colour. This problem is a special c

Quadratic bottleneck problems

✍ Abraham P. Punnen; Ruonan Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

Generalized model for solving constraine

Generalized model for solving constrained bottlenecks

✍ Gerhard J. Plenert 📂 Article 📅 1993 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 514 KB

Approximating Node-Deletion Problems for

Approximating Node-Deletion Problems for Matroidal Properties

✍ Toshihiro Fujito 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 134 KB

The paper is concerned with the polynomial time approximability of node-deletion problems for hereditary properties. It is observed that, when such a property derives a matroid on any graph, the problem can be formulated as a matroid set cover optimization problem, and this leads us naturally to con

Matroidal relaxations for 0–1 knapsack p

Matroidal relaxations for 0–1 knapsack problems

✍ Lígia Amado; Paulo Barcia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Stability in bottleneck problems

✍ E.N. Gordeev; V.K. Leont'ev 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 372 KB