Pages that link to "Item:Q3820348"
From MaRDI portal
The following pages link to Send-and-Split Method for Minimum-Concave-Cost Network Flows (Q3820348):
Displayed 50 items.
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Capacitated lot-sizing with extensions: a review (Q926571) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725) (← links)
- Steiner trees with \(n\) terminals among \(n+1\) nodes (Q1197890) (← links)
- Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636) (← links)
- On obstructions to small face covers in planar graphs (Q1204479) (← links)
- Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
- An algorithm for a concave production cost network flow problem (Q1301576) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- On finding two-connected subgraphs in planar graphs (Q1376267) (← links)
- A simplex algorithm for a class of Leontief flow problems (Q1381763) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- A dynamic programming approach for the pipe network layout problem (Q1735166) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Gainfree Leontief substitution flow problems (Q1802953) (← links)
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
- Probabilistic local search algorithms for concave cost transportation network problems (Q1806939) (← links)
- Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks (Q1869722) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Faster algorithm for optimum Steiner trees (Q1944205) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Minimum concave cost flow over a grid network (Q2340279) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (Q2828332) (← links)
- The complexity of welfare maximization in congestion games (Q2892161) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface (Q3452802) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)