A faster polynomial algorithm for the constrained maximum flow problem - CALISKAN, Cenk (Computers & operations research, 2012)
Keywords: Algorithms; Applied sciences; Combinatorial analysis; Comparative studies; Computational complexity; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Constraints; Costs; Exact sciences and technology; Flows in networks. Combinatorial problems; Inventory control, production control. Distribution; Logistics; Maximum flow; Minimum cost network flow; Network flow problem; Network flows; Operational research and scientific management; Operational research. Management science; Operations research; Polynomials; Scaling; Shortest-path problems; Software; Transportation problem; Transportation problem (Operations research); Scaling; Minimum cost network flow; Network flows; Computational complexity; Maximum flow; Costs; Network flow; Assignment problem; Combinatorial problem; Empirical method; Shortest path; Graph theory; Distributed system; Combinatorial optimization; Source sink relationship; Source flow; Transportation problem; Computer network; Time average; Telecommunication network; Budget; Capacity constraint; Optimal flow; Logistics