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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Networks Ročník 33; číslo 1; s. 29 - 41
Hlavní autoři:	Fremuth-Paeger, Christian, Jungnickel, Dieter
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York John Wiley & Sons, Inc 01.01.1999 John Wiley & Sons
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!