On node constraint networks
From MaRDI portal
Publication:3787765
DOI10.1002/net.3230150408zbMath0644.90034MaRDI QIDQ3787765
Publication date: 1985
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230150408
poset; circulation theorem; max flow-min cut; min flow-max cut; node constraint versions; optimum antichain; optimum convex set
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Cites Work