Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms

zbMath0658.90031MaRDI QIDQ1210806

Ulrich Derigs

Publication date: 5 June 1993

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

zbMATH Keywords

network flowmatching algorithmsshortest augmenting path methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (3)

Algorithms for finding a \(K\)th best valued assignment ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ Parallel machine scheduling to minimize costs for earliness and number of tardy jobs

This page was built for publication: Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms