Stable flows over time

DOI10.3390/a6030532zbMath1461.91196OpenAlexW2152327218MaRDI QIDQ1736580

Jannik Matuschke, Martin Skutella, Ágnes Cseh

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6030532

zbMATH Keywords

stable matchingsflows over timestable flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68) Flows in graphs (05C21)

Related Items (4)

On stable flows and preflows ⋮ Stable multicommodity flows ⋮ Editorial: Special issue on matching under preferences ⋮ New and simple algorithms for stable flow problems

Cites Work

• Unnamed Item
• Faster algorithms for stable allocation problems
• On Stable Matchings and Flows
• Constructing Maximal Dynamic Flows from Static Flows
• Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
• The Stable Allocation (or Ordinal Transportation) Problem
• College Admissions and the Stability of Marriage

This page was built for publication: Stable flows over time