The following pages link to Multi-Terminal Network Flows (Q3849459):
Displayed 50 items.
- The range of ultrametrics, compactness, and separability (Q2052580) (← links)
- Ultrametric preserving functions and weak similarities of ultrametric spaces (Q2062351) (← links)
- On the motion of substance in a channel and growth of random networks (Q2078640) (← links)
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- On the motion of substance in a channel of a network and human migration (Q2150067) (← links)
- Minimum spanning paths and Hausdorff distance in finite ultrametric spaces (Q2152004) (← links)
- Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration (Q2153209) (← links)
- Statistical distributions connected to motion of substance in a channel of a network (Q2161723) (← links)
- Mincut sensitivity data structures for the insertion of an edge (Q2165037) (← links)
- Co-density and fractional edge cover packing (Q2175043) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
- Vertex-weighted realizations of graphs (Q2286737) (← links)
- Finite ultrametric balls (Q2293727) (← links)
- Parametric analysis on cut-trees and its application on a protein clustering problem (Q2303335) (← links)
- On some extremal properties of finite ultrametric spaces (Q2303899) (← links)
- Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
- From isomorphic rooted trees to isometric ultrametric spaces (Q2317204) (← links)
- Properties and morphisms of finite ultrametric spaces and their representing trees (Q2327924) (← links)
- A distributed exact algorithm for the multiple resource constrained sequencing problem (Q2368093) (← links)
- Flows over edge-disjoint mixed multipaths and applications (Q2381819) (← links)
- How rigid the finite ultrametric spaces can be? (Q2409470) (← links)
- The flow network method (Q2417378) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations (Q2465934) (← links)
- Simulated annealing heuristics for the dynamic facility layout problem (Q2489299) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks (Q2522606) (← links)
- Flow variation in multiple min-cut calculations (Q2541619) (← links)
- The sensitivity of a traffic network (Q2551066) (← links)
- Hybrid ant systems for the dynamic facility layout problem (Q2566943) (← links)
- Multiroute flows: cut-trees and realizability (Q2581318) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- An algorithm for computing maximum solution bases (Q2641220) (← links)
- Polynomially determining spanning connectivity of locally connected line graphs (Q2661222) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Edge-connectivity matrices and their spectra (Q2668063) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Hereditary properties of finite ultrametric spaces (Q2683540) (← links)
- On the robustness of potential-based flow networks (Q2689822) (← links)
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
- Impact of a varying capacity on the all pairs 2-route network flows (Q2840515) (← links)
- Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs (Q2946426) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Sensitivity analysis on the all pairs<i>q</i>-route flows in a network (Q3002694) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- Network flow spanners (Q3057178) (← links)
- On integer network synthesis problem with tree-metric cost (Q3121495) (← links)