Balanced network flows. II. Simple augmentation algorithms

In previous papers, we discussed the fundamental theory of matching problems and algorithms in terms of a network flow model. In this paper, we present explicit augmentation procedures which apply to the wide range of capacitated matching problems and which are highly efficient for k‐factor problems...

Full description

Saved in:
Bibliographic Details
Published in:Networks Vol. 33; no. 1; pp. 29 - 41
Main Authors: Fremuth-Paeger, Christian, Jungnickel, Dieter
Format: Journal Article
Language:English
Published: New York John Wiley & Sons, Inc 01.01.1999
John Wiley & Sons
Subjects:
antisymmetrical digraphs
Applied sciences
augmenting a matching
balanced flow networks
capacitated matching problems
Exact sciences and technology
Flows in networks. Combinatorial problems
matching heuristics
network flows
Operational research and scientific management
Operational research. Management science
skew-symmetric graphs
First depth search
Balancing
Network flow
Capacity
Symmetric graph
Heuristic method
Graph theory
Algorithm
ISSN:0028-3045, 1097-0037
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In previous papers, we discussed the fundamental theory of matching problems and algorithms in terms of a network flow model. In this paper, we present explicit augmentation procedures which apply to the wide range of capacitated matching problems and which are highly efficient for k‐factor problems and the f‐factor problem. © 1999 John Wiley & Sons, Inc. Networks 33: 29–41, 1999
Bibliography:ark:/67375/WNG-R21ZZ6PX-V
ArticleID:NET2
The results of this paper form part of the first author's doctoral thesis which was written under the supervision of the second author. AMS subject classification: 05C70, 90B10, 90C35
istex:CEB476EF40B5E1749F8D4718E1C5CAE29EE0ABEC
The results of this paper form part of the first author's doctoral thesis which was written under the supervision of the second author.
AMS subject classification: 05C70, 90B10, 90C35
ISSN:0028-3045
1097-0037
DOI:10.1002/(SICI)1097-0037(199901)33:1<29::AID-NET2>3.0.CO;2-U