Multi-Terminal Network Flows
From MaRDI portal
Publication:3849459
DOI10.1137/0109047zbMath0112.12405OpenAlexW2115049345MaRDI 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 (only showing first 100 items - show all)
Network design and dynamic routing under queueing demand ⋮ On the (near) optimality of extended formulations for multi-way cut in social networks ⋮ A distributed exact algorithm for the multiple resource constrained sequencing problem ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Tight Bounds for Gomory-Hu-like Cut Counting ⋮ Flows over edge-disjoint mixed multipaths and applications ⋮ On the motion of substance in a channel of a network and human migration ⋮ Minimum spanning paths and Hausdorff distance in finite ultrametric spaces ⋮ An algorithm for computing maximum solution bases ⋮ Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration ⋮ Optimization in telecommunication networks ⋮ Statistical distributions connected to motion of substance in a channel of a network ⋮ Mincut sensitivity data structures for the insertion of an edge ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Co-density and fractional edge cover packing ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ When Do Gomory--Hu Subtrees Exist? ⋮ How rigid the finite ultrametric spaces can be? ⋮ TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration ⋮ Edge-connectivity matrices and their spectra ⋮ Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs ⋮ The flow network method ⋮ Polyhedral Combinatorics in Combinatorial Optimization ⋮ Computing Area-Optimal Simple Polygonizations ⋮ \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms ⋮ A branch-and-cut algorithm for the generalized traveling salesman problem with time windows ⋮ Uniformly connected graphs ⋮ Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs ⋮ The Capacitated and Economic Districting Problem ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ Hereditary properties of finite ultrametric spaces ⋮ A branch-and-cut algorithm for the balanced traveling salesman problem ⋮ Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs ⋮ Uniformly 3‐connected graphs ⋮ Edge degeneracy: algorithmic and structural results ⋮ A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems ⋮ Efficient Algorithms for the k Smallest Cuts Enumeration ⋮ Unnamed Item ⋮ A theoretical and computational study of green vehicle routing problems ⋮ On a Special Co-cycle Basis of Graphs ⋮ On the robustness of potential-based flow networks ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Optimal flows in networks with multiple sources and sinks ⋮ Densities, Matchings, and Fractional Edge-Colorings ⋮ Efficiently Realizing Interval Sequences ⋮ Multigraph augmentation under biconnectivity and general edge-connectivity requirements ⋮ Practical Minimum Cut Algorithms ⋮ Metric and ultrametric spaces of resistances ⋮ On ultrametric-preserving functions ⋮ Cut problems in graphs with a budget constraint ⋮ Mincut Sensitivity Data Structures for the Insertion of an Edge ⋮ Sensitivity analysis on the all pairsq-route flows in a network ⋮ Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ On minimum 3-cuts and approximating k-cuts using Cut Trees ⋮ Branch and cut methods for network optimization ⋮ Simulated annealing heuristics for the dynamic facility layout problem ⋮ Local Flow Partitioning for Faster Edge Connectivity ⋮ Unnamed Item ⋮ A branch-and-cut algorithm for the k-edge connected subgraph problem ⋮ Network flow spanners ⋮ Minimum Cuts of Simple Graphs in Almost Always Linear Time ⋮ Designing multi-commodity flow trees ⋮ Heuristic algorithms for packing of multiple-group multicasting ⋮ Vertex-weighted realizations of graphs ⋮ Engpässe, Staustellen und glatte homogene Ströme in Netzen ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty ⋮ Finite ultrametric balls ⋮ Composed degree-distance realizations of graphs ⋮ A new contraction technique with applications to congruency-constrained cuts ⋮ On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks ⋮ Composed degree-distance realizations of graphs ⋮ Dynamic Graph Clustering Using Minimum-Cut Trees ⋮ The range of ultrametrics, compactness, and separability ⋮ Parametric analysis on cut-trees and its application on a protein clustering problem ⋮ On some extremal properties of finite ultrametric spaces ⋮ Symmetric submodular system: contractions and Gomory-Hu tree ⋮ IFORS' Operational Research Hall of Fame ⋮ Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links ⋮ Flow variation in multiple min-cut calculations ⋮ Ultrametric preserving functions and weak similarities of ultrametric spaces ⋮ Analyse und Synthese zuverlässiger Netze ⋮ The sensitivity of a traffic network ⋮ From isomorphic rooted trees to isometric ultrametric spaces ⋮ Multiterminal network flows and applications ⋮ Impact of a varying capacity on the all pairs 2-route network flows ⋮ Faster algorithms for shortest path and network flow based on graph decomposition ⋮ On the motion of substance in a channel and growth of random networks ⋮ Properties and morphisms of finite ultrametric spaces and their representing trees ⋮ Hybrid ant systems for the dynamic facility layout problem ⋮ Decomposition algorithms for locating minimal cuts in a network ⋮ On integer network synthesis problem with tree-metric cost ⋮ Fast Augmenting Paths by Random Sampling from Residual Graphs ⋮ Unnamed Item ⋮ Multiroute flows: cut-trees and realizability ⋮ Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut ⋮ Dynamic programming and graph optimization problems
This page was built for publication: Multi-Terminal Network Flows
