𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Separating from the dominant of the spanning tree polytope

✍ Scribed by Francisco Barahona

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
160 KB
Volume
12
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Separating multi-oddity constrained shor
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets
✍ Eddie Cheng; Sven de Vries πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 173 KB

The maximum stable set problem is NP-hard. Koster and Zymolka introduced as a generalization the stable multiset problem by allowing vertices multiple times subject to vertex-and edge capacities and introduced cycle inequalities. We derive an e cient separation algorithm for them.

The number of spanning trees in buckmins
The number of spanning trees in buckminsterfullerene
✍ T. J. N. Brown; R. B. Mallion; P. Pollak; Branca R. M. de Castro; J. A. N. F. Go πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 662 KB

## Abstract The theorem of Gutman et al. (1983) is applied to calculate the number of spanning trees in the carbon‐carbon connectivity‐network of the recently diagnosed C~60~‐cluster buckminsterfullerene. This β€œcomplexity” turns out to be approximately 3.75 Γ— 10^20^ and it is found necessary to inv