Multi-Terminal Network Flows
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Integer version of the multipath flow network synthesis problem
- Detecting critical nodes in sparse graphs
- A note on two source location problems
- A graph b-coloring framework for data clustering
- Solving the prize-collecting rural postman problem
- On spanning tree congestion of graphs
- On spanning tree congestion
- Decomposition of submodular functions
- \(K_ i\)-covers. I: Complexity and polytopes
- A decomposition algorithm for multi-terminal network flows
- Multi-terminal maximum flows in node-capacitated networks
- 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
- 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
- Strong linear orderings of a directed network
- 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 simple minimum \(T\)-cut algorithm
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- A tabu search algorithm for self-healing ring network design.
- Reconstructing edge-disjoint paths.
- A supertree method for rooted trees
- A clustering algorithm based on graph connectivity
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
- Efficient pattern matching on big uncertain graphs
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
- Greedy splitting algorithms for approximating multiway partition problems
- A computational comparison of flow formulations for the capacitated location-routing problem
- Implementing an efficient minimum capacity cut algorithm
- Parametric min-cuts analysis in a network.
- Characterizing the flow equivalent trees of a network
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- A cutting plane algorithm for minimum perfect 2-matchings
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- Multi-terminal multipath flows: synthesis
- 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
- Compact cactus representations of all non-trivial min-cuts
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
- Solving the optimum communication spanning tree problem
- Maximizing the algebraic connectivity of meshed electrical pathways used as current return network
- Combinatorial properties of ultrametrics and generalized ultrametrics
- The range of ultrametrics, compactness, and separability
- Ultrametric preserving functions and weak similarities of ultrametric spaces
- On the motion of substance in a channel and growth of random networks
- On the (near) optimality of extended formulations for multi-way cut in social networks
- On the motion of substance in a channel of a network and human migration
- Minimum spanning paths and Hausdorff distance in finite ultrametric spaces
- Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration
- Statistical distributions connected to motion of substance in a channel of a network
- Mincut sensitivity data structures for the insertion of an edge
- Co-density and fractional edge cover packing
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Edge degeneracy: algorithmic and structural results
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- Vertex-weighted realizations of graphs
- Finite ultrametric balls
- 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
- From isomorphic rooted trees to isometric ultrametric spaces
- Properties and morphisms of finite ultrametric spaces and their representing trees
- A distributed exact algorithm for the multiple resource constrained sequencing problem
- Flows over edge-disjoint mixed multipaths and applications
- How rigid the finite ultrametric spaces can be?
- The flow network method
- Cut problems in graphs with a budget constraint
- Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
- Simulated annealing heuristics for the dynamic facility layout problem
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks
- Flow variation in multiple min-cut calculations
- The sensitivity of a traffic network
- Hybrid ant systems for the dynamic facility layout problem
- Multiroute flows: cut-trees and realizability
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
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)
