The following pages link to Multi-Terminal Network Flows (Q3849459):
Displaying 50 items.
- A note on minimizing submodular functions (Q293366) (← links)
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- Sink location to find optimal shelters in evacuation planning (Q339937) (← links)
- On the collaboration uncapacitated arc routing problem (Q342264) (← links)
- Structural properties of the minimum cut of partially-supplied graphs (Q406340) (← links)
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
- Graph clustering (Q458448) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- On the Gomory-Hu inequality (Q460733) (← links)
- On spaces extremal for the Gomory-Hu inequality (Q498716) (← links)
- Exact evaluation of targeted stochastic watershed cuts (Q528342) (← links)
- On Chinese postman games where residents of each road pay the cost of their road (Q550185) (← links)
- A network flow model of group technology (Q597530) (← links)
- Survivable network design with demand uncertainty (Q631096) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Canonical decompositions of symmetric submodular systems (Q760444) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Efficient spanning trees (Q796551) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
- Flow equivalent trees in undirected node-edge-capacitated planar graphs (Q845841) (← links)
- Minimum degree orderings (Q848936) (← links)
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- Flow trees for vertex-capacitated networks (Q869579) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- An efficient algorithm for the minimum capacity cut problem (Q922927) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- George Dantzig's contributions to integer programming (Q951090) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
- Detecting critical nodes in sparse graphs (Q1013394) (← links)
- A note on two source location problems (Q1018105) (← links)
- A graph b-coloring framework for data clustering (Q1040797) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- On spanning tree congestion (Q1044004) (← links)
- Decomposition of submodular functions (Q1053717) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- A decomposition algorithm for multi-terminal network flows (Q1085042) (← links)
- Multi-terminal maximum flows in node-capacitated networks (Q1085773) (← links)
- The minimal average cost flow problem (Q1130071) (← links)
- The planar multiterminal cut problem (Q1130183) (← links)
- Ancestor tree for arbitrary multi-terminal cut functions (Q1179737) (← links)
- Multiterminal xcut problems (Q1179738) (← links)
- A note on bounding \(k\)-terminal reliability (Q1186804) (← links)
