scientific article; zbMATH DE number 842873

zbMATH Open0841.68098MaRDI QIDQ4862333FDOQ4862333

Authors: Doug Stone, William Kocay 

Publication date: 2 July 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1769330
• TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
• scientific article; zbMATH DE number 653269
• A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
• Balanced network flows. III. Strongly polynomial augmentation algorithms

zbMATH Keywords

network flowsmaximum matchingsfactor problembalanced network searchmaximum capacitated \(b\)-matchings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (6)

• Balanced network flows. III. Strongly polynomial augmentation algorithms
• Balanced network flows. V: Cycle-canceling algorithms.
• Balanced network flows. VI: Polyhedral descriptions.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862333)