Pages that link to "Item:Q3820348"

The following pages link to Send-and-Split Method for Minimum-Concave-Cost Network Flows (Q3820348):

Displayed 38 items.

• Minimum-weight two-connected spanning networks (Q582215) ‎ (← 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)
• 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)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) ‎ (← 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)
• On the Steiner 2-edge connected subgraph polytope (Q3598034) ‎ (← links)
• (Q4266754) ‎ (← links)
• Probabilistic analysis of an lp relaxation bound for the steiner problem in networks (Q4732318) ‎ (← links)
• Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) ‎ (← links)
• A branch-and-price algorithm for switch-box routing (Q4785215) ‎ (← links)
• Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) ‎ (← links)
• A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) ‎ (← links)