Multi-Terminal Network Flows

DOI10.1137/0109047zbMATH Open0112.12405OpenAlexW2115049345MaRDI QIDQ3849459FDOQ3849459

Authors:

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

zbMATH Keywords

applications of probability theory and statistics

Cited In (only showing first 100 items - show all)

• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
• Minimum cut bases in undirected networks
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Greedy splitting algorithms for approximating multiway partition problems
• A decomposition algorithm for multi-terminal network flows
• Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
• Faster algorithms for all-pairs bounded min-cuts
• Survivable networks, linear programming relaxations and the parsimonious property
• Structural properties of the minimum cut of partially-supplied graphs
• A cutting plane algorithm for minimum perfect 2-matchings
• A supertree method for rooted trees
• On spanning tree congestion of graphs
• On spanning tree congestion
• Polyhedral Combinatorics in Combinatorial Optimization
• Metric and ultrametric spaces of resistances
• Generating lower bounds for the linear arrangement problem
• George Dantzig's contributions to integer programming
• Decomposition of submodular functions
• Combinatorial properties of ultrametrics and generalized ultrametrics
• Detecting critical nodes in sparse graphs
• Single-commodity robust network design problem: complexity, instances and heuristic solutions
• A note on minimizing submodular functions
• Design of survivable IP-over-optical networks
• The traveling salesman problem: An overview of exact and approximate algorithms
• Implementing an efficient minimum capacity cut algorithm
• Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
• A network flow model of group technology
• On Chinese postman games where residents of each road pay the cost of their road
• Optimal flows in networks with multiple sources and sinks
• Minimizing symmetric submodular functions
• Canonical decompositions of symmetric submodular systems
• \(K_ i\)-covers. I: Complexity and polytopes
• Facet identification for the symmetric traveling salesman polytope
• Data analysis implications of some concepts related to the cuts of a graph
• The saga of minimum spanning trees
• On the Gomory-Hu inequality
• Solving the prize-collecting rural postman problem
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
• Optimizing over the subtour polytope of the travelling salesman problem
• On spaces extremal for the Gomory-Hu inequality
• Improved bounds for large scale capacitated arc routing problem
• Ancestor tree for arbitrary multi-terminal cut functions
• Location and layout planning. A survey
• The most vital edges in the minimum spanning tree problem
• Multigraph augmentation under biconnectivity and general edge-connectivity requirements
• Integer version of the multipath flow network synthesis problem
• On ultrametric-preserving functions
• Survivable network design with demand uncertainty
• Properties of Gomory-Hu co-cycle bases
• Finding minimum 3-way cuts in hypergraphs
• A computational comparison of flow formulations for the capacitated location-routing problem
• Sink location to find optimal shelters in evacuation planning
• An efficient algorithm for the minimum capacity cut problem
• On the collaboration uncapacitated arc routing problem
• On spanning tree problems with multiple objectives
• On minimum 3-cuts and approximating k-cuts using cut trees
• Solution of large-scale symmetric travelling salesman problems
• Simulated annealing heuristics for the dynamic facility layout problem
• A clustering algorithm based on graph connectivity
• Flow equivalent trees in undirected node-edge-capacitated planar graphs
• A graph b-coloring framework for data clustering
• Optimization in telecommunication networks
• Dynamic Graph Clustering Using Minimum-Cut Trees
• A tabu search algorithm for self-healing ring network design.
• Static and dynamic source locations in undirected networks
• Solving combinatorial optimization problems using Karmarkar's algorithm
• Solving the linear matroid parity problem as a sequence of matroid intersection problems
• Graph clustering
• Cut problems in graphs with a budget constraint
• A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
• Flow in planar graphs with vertex capacities
• The precedence-constrained asymmetric traveling salesman polytope
• Minimizing submodular functions over families of sets
• Minimum block containing a given graph
• Multi-terminal maximum flows in node-capacitated networks
• Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration
• An efficient approximation algorithm for the survivable network design problem
• Efficient spanning trees
• Exact evaluation of targeted stochastic watershed cuts
• Maximum concurrent flows and minimum cuts
• An algorithm for computing maximum solution bases
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
• Connectivity of submodular functions
• Undirected postman problems with zigzagging option: a cutting-plane approach
• Analyse und Synthese zuverlässiger Netze
• Tight Bounds for Gomory-Hu-like Cut Counting
• The flow network method
• Parametric analysis on cut-trees and its application on a protein clustering problem
• Symmetric submodular system: contractions and Gomory-Hu tree
• Compact cactus representations of all non-trivial min-cuts
• On the motion of substance in a channel and growth of random networks
• Composed degree-distance realizations of graphs
• Composed degree-distance realizations of graphs
• Statistical distributions connected to motion of substance in a channel of a network
• Flow variation in multiple min-cut calculations
• Scalable timing-aware network design via Lagrangian decomposition
• Edge degeneracy: algorithmic and structural results
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• Heuristic algorithms for packing of multiple-group multicasting
• Efficiently realizing interval sequences

This page was built for publication: Multi-Terminal Network Flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3849459)