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
Dynamic programming and graph optimization problems, Mixed integer formulations using natural variables for single machine scheduling around a common due date, Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm, A decomposition algorithm for multi-terminal network flows, Multi-terminal maximum flows in node-capacitated networks, On spanning tree problems with multiple objectives, A note on minimizing submodular functions, Multi-terminal multipath flows: synthesis, Single-commodity robust network design problem: complexity, instances and heuristic solutions, The precedence-constrained asymmetric traveling salesman polytope, Generating lower bounds for the linear arrangement problem, Flow equivalent trees in undirected node-edge-capacitated planar graphs, Minimum degree orderings, Efficient algorithms for the problems of enumerating cuts by non-decreasing weights, Improved bounds for large scale capacitated arc routing problem, Sink location to find optimal shelters in evacuation planning, On the collaboration uncapacitated arc routing problem, Minimizing submodular functions over families of sets, Design of survivable IP-over-optical networks, Generalizing the all-pairs min cut problem, Location and layout planning. A survey, Flow trees for vertex-capacitated networks, A network flow model of group technology, Efficient pattern matching on big uncertain graphs, Multiterminal flows and cuts, The network synthesis problem in a cycle, The minimal average cost flow problem, The planar multiterminal cut problem, Static and dynamic source locations in undirected networks, Structural properties of the minimum cut of partially-supplied graphs, A simple minimum \(T\)-cut algorithm, Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups., Survivable network design with demand uncertainty, A tabu search algorithm for self-healing ring network design., Reconstructing edge-disjoint paths., Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem, Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs, Facet identification for the symmetric traveling salesman polytope, Graph clustering, The saga of minimum spanning trees, On the Gomory-Hu inequality, An efficient algorithm for the minimum capacity cut problem, Undirected postman problems with zigzagging option: a cutting-plane approach, Ancestor tree for arbitrary multi-terminal cut functions, Multiterminal xcut problems, A note on bounding \(k\)-terminal reliability, On spaces extremal for the Gomory-Hu inequality, Compact cactus representations of all non-trivial min-cuts, Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions, George Dantzig's contributions to integer programming, 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, Solving the optimum communication spanning tree problem, 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, Maximizing the algebraic connectivity of meshed electrical pathways used as current return network, Survivable networks, linear programming relaxations and the parsimonious property, Combinatorial properties of ultrametrics and generalized ultrametrics, Exact evaluation of targeted stochastic watershed cuts, The most vital edges in the minimum spanning tree problem, Minimum cut bases in undirected networks, On Chinese postman games where residents of each road pay the cost of their road, Greedy splitting algorithms for approximating multiway partition problems, Minimum block containing a given graph, A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy, Data analysis implications of some concepts related to the cuts of a graph, A set-theoretical approach to the problem of hierarchical clustering, Integer version of the multipath flow network synthesis problem, Strong linear orderings of a directed network, A computational comparison of flow formulations for the capacitated location-routing problem, Implementing an efficient minimum capacity cut algorithm, Extracting maximal information about sets of minimum cuts, Detecting critical nodes in sparse graphs, Parametric min-cuts analysis in a network., Characterizing the flow equivalent trees of a network, A note on two source location problems, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Canonical decompositions of symmetric submodular systems, A cutting plane algorithm for minimum perfect 2-matchings, Properties of Gomory-Hu co-cycle bases, Finding minimum 3-way cuts in hypergraphs, A graph b-coloring framework for data clustering, Minimizing symmetric submodular functions, An efficient approximation algorithm for the survivable network design problem, Solving the prize-collecting rural postman problem, On spanning tree congestion of graphs, On spanning tree congestion, A supertree method for rooted trees, On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic, Decomposition of submodular functions, A cell formation algorithm: Hypergraph approximation -- cut tree, Efficient spanning trees, Optimizing over the subtour polytope of the travelling salesman problem, Flow in planar graphs with vertex capacities, Solution of large-scale symmetric travelling salesman problems, \(K_ i\)-covers. I: Complexity and polytopes, A clustering algorithm based on graph connectivity, Designing multi-commodity flow trees, 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
