Multi-Terminal Network Flows
From MaRDI portal
Publication:3849459
DOI10.1137/0109047zbMath0112.12405MaRDI QIDQ3849459
No author found.
Publication date: 1961
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0109047
Related Items
Survivable networks, linear programming relaxations and the parsimonious property, The minimal average cost flow problem, The planar multiterminal cut problem, Ancestor tree for arbitrary multi-terminal cut functions, Multiterminal xcut problems, A note on bounding \(k\)-terminal reliability, Maximum concurrent flows and minimum cuts, The traveling salesman problem: An overview of exact and approximate algorithms, Solving combinatorial optimization problems using Karmarkar's algorithm, Flow network design for manufacturing systems layout, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, Connectivity of submodular functions, The most vital edges in the minimum spanning tree problem, Extracting maximal information about sets of minimum cuts, Minimizing symmetric submodular functions, An efficient approximation algorithm for the survivable network design problem, A cell formation algorithm: Hypergraph approximation -- cut tree, Flow in planar graphs with vertex capacities, Designing multi-commodity flow trees, Dynamic programming and graph optimization problems, On spanning tree problems with multiple objectives, Location and layout planning. A survey, A supertree method for rooted trees, Implementing an efficient minimum capacity cut algorithm, Solving the linear matroid parity problem as a sequence of matroid intersection problems, The precedence-constrained asymmetric traveling salesman polytope, Generating lower bounds for the linear arrangement problem, Minimizing submodular functions over families of sets, Generalizing the all-pairs min cut problem, Multiterminal flows and cuts, The network synthesis problem in a cycle, A distributed exact algorithm for the multiple resource constrained sequencing problem
