Flow Networks and Combinatorial Operations Research
- 5 February 1966
- journal article
- research article
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 73 (2) , 115-138
- https://doi.org/10.1080/00029890.1966.11970730
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- Monotone networksProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1960
- A Network-Flow Feasibility Theorem and Combinatorial ApplicationsCanadian Journal of Mathematics, 1959
- A theorem on flows in networksPacific Journal of Mathematics, 1957
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955
- Minimizing the number of tankers to meet a fixed scheduleNaval Research Logistics Quarterly, 1954
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935