𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fractional covers for forests and matchings

✍ Scribed by Manfred W. Padberg; Laurence A. Wolsey

Book ID
110572891
Publisher
Springer-Verlag
Year
1984
Tongue
English
Weight
553 KB
Volume
29
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dynamic matchings and quasidynamic fract
Dynamic matchings and quasidynamic fractional matchings. I
✍ James B. Orlin πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 560 KB

## Abstract This paper presents and solves in polynomial time the dynamic matching problem, an integer programming problem which involves matchings in a time‐expanded infinite network. The initial model is a finite directed graph __G__ = (__V, E__) in which each edge has an associated real‐valued w

Dynamic matchings and quasidynamic fract
Dynamic matchings and quasidynamic fractional matchings. II
✍ James B. Orlin πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 869 KB

Consider a directed graph G in which every edge has an associated real-valued distance and a real-valued weight. The weight of an undirected circuit of C is the sum of the weights of the edges, whereas the distance of an undirected circuit is the sum of the distances of the forward edges of the circ