✦ LIBER ✦

Vertex packings: Structural properties and algorithms

✍ Scribed by G. L. Nemhauser; L. E. Trotter

Publisher: Springer-Verlag
Year: 1975
Tongue: English
Weight: 843 KB
Volume: 8
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580444

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex packings: Structural properties a

Vertex packings: Structural properties and algorithms

✍ G. L. Nemhauser; L. E. Trotter 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 843 KB

We consider a binary integer programming formulation (VP) for the weighted vertex packing problem in a simple graph. A sufficient "local" optimality condition for (VP) is given and this result is used to derive relations between (VP) and the linear program (VLP) obtained by deleting the integrality

Algorithm for the vertex packing problem

✍ Yu. V. Voitishin; E. A. Sharkovskaya 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 184 KB

Strongly polynomial simplex algorithm fo

Strongly polynomial simplex algorithm for bipartite vertex packing

✍ Ronald D. Armstrong; Zhiying Jin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Properties of vertex packing and indepen

Properties of vertex packing and independence system polyhedra

✍ G. L. Nemhauser; L. E. Trotter 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

The vertex separator problem: algorithms

The vertex separator problem: algorithms and computations

✍ Cid de Souza; Egon Balas 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

A polynomial algorithm for maximum weigh

A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles

✍ Wen-lian Hsu; Yoshiro Ikura; George L. Nemhauser 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 398 KB