Flow Networks and Combinatorial Operations Research

DOI10.2307/2313544zbMath0168.40706OpenAlexW4234076532WikidataQ56172607 ScholiaQ56172607MaRDI QIDQ5555419

D. R. Fulkerson

Publication date: 1966

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2313544

zbMATH Keywords

operations research

Related Items (7)

Some problems in discrete optimization ⋮ Operational Research in the Wine Supply Chain ⋮ Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs ⋮ Blocking systems of a graph and intersection-union interchange equality in bottleneck problems involving sets and fuzzy sets ⋮ An improved version of the out-of-kilter method and a comparative study of computer codes ⋮ Optimal scheduling for two-processor systems ⋮ Microcomputer-based algorithms for large scale shortest path problems

This page was built for publication: Flow Networks and Combinatorial Operations Research