𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparative analysis of several formulations for the generalized minimum spanning tree problem

✍ Scribed by Corinne Feremans; Martine Labbé; Gilbert Laporte

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
423 KB
Volume
39
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hierarchy of hop-indexed models for th
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem
✍ Gouveia, Luis; Martins, Pedro 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning tree subject to an additional constraint stating that the number of nodes in each subtree pending from a given root node is not greater than a given number Q. Gouveia and Martins (1996) proposed a hop-indexed flow mo

Analysis and convergence of a MAC-like s
Analysis and convergence of a MAC-like scheme for the generalized Stokes problem
✍ S. H. Chou; D. Y. Kwak 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 2 views

We introduce a MAC-like scheme (a covolume method on rectangular grids) for approximating the generalized Stokes problem on an axiparallel domain. Two staggered grids are used in the derivation of the discretization. The velocity is approximated by conforming bilinears over rectangular elements, and