The following pages link to Multi-Terminal Network Flows (Q3849459):
Displayed 50 items.
- Maximum concurrent flows and minimum cuts (Q1194345) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Flow network design for manufacturing systems layout (Q1197683) (← links)
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938) (← links)
- Connectivity of submodular functions (Q1199483) (← links)
- The most vital edges in the minimum spanning tree problem (Q1209313) (← links)
- Minimum block containing a given graph (Q1230635) (← links)
- A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy (Q1232425) (← links)
- Data analysis implications of some concepts related to the cuts of a graph (Q1237024) (← links)
- A set-theoretical approach to the problem of hierarchical clustering (Q1238382) (← links)
- Strong linear orderings of a directed network (Q1253240) (← links)
- Extracting maximal information about sets of minimum cuts (Q1261290) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- A cell formation algorithm: Hypergraph approximation -- cut tree (Q1303737) (← links)
- Flow in planar graphs with vertex capacities (Q1317474) (← links)
- Designing multi-commodity flow trees (Q1321837) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- On spanning tree problems with multiple objectives (Q1339178) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- A simple minimum \(T\)-cut algorithm (Q1406048) (← links)
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
- A tabu search algorithm for self-healing ring network design. (Q1410612) (← links)
- Reconstructing edge-disjoint paths. (Q1413914) (← links)
- A supertree method for rooted trees (Q1582076) (← links)
- A clustering algorithm based on graph connectivity (Q1607070) (← links)
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
- Efficient pattern matching on big uncertain graphs (Q1671698) (← links)
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
- Implementing an efficient minimum capacity cut algorithm (Q1804650) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- Characterizing the flow equivalent trees of a network (Q1811121) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- A cutting plane algorithm for minimum perfect 2-matchings (Q1821798) (← links)
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic (Q1847145) (← links)
- Multi-terminal multipath flows: synthesis (Q1887053) (← links)
- The precedence-constrained asymmetric traveling salesman polytope (Q1890926) (← links)
- Generating lower bounds for the linear arrangement problem (Q1891924) (← links)
- Minimizing submodular functions over families of sets (Q1906848) (← links)
- Generalizing the all-pairs min cut problem (Q1910514) (← links)
- Multiterminal flows and cuts (Q1924611) (← links)
- The network synthesis problem in a cycle (Q1924616) (← links)
- Compact cactus representations of all non-trivial min-cuts (Q1983141) (← links)
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions (Q1987237) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Maximizing the algebraic connectivity of meshed electrical pathways used as current return network (Q1997383) (← links)
- Combinatorial properties of ultrametrics and generalized ultrametrics (Q1999126) (← links)