Pages that link to "Item:Q5564921"

The following pages link to A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems (Q5564921):

Displaying 50 items.

• About the minimum mean cycle-canceling algorithm (Q499347) (← links)
• The problem of maximum flow with minimum attainable cost in a network (Q505156) (← links)
• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
• A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
• Uncertain minimum cost flow problem (Q894387) (← links)
• Algorithms for storage allocation based on client preferences (Q975763) (← links)
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
• A transportation type aggregate production model with bounds on inventory and backordering (Q1099068) (← links)
• Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
• Weighted min cost flows (Q1168883) (← links)
• Negative circuits for flows and submodular flows (Q1192951) (← links)
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
• Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
• Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
• Computing maximum mean cuts (Q1329796) (← links)
• A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
• Convexification of generalized network flow problem (Q1717233) (← links)
• Collaborative vehicle routing: a survey (Q1754297) (← links)
• Flow constrained minimum cost flow problem (Q1937859) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
• Margin of victory for tournament solutions (Q2060724) (← links)
• Approximate Wasserstein attraction flows for dynamic mass transport over networks (Q2158987) (← links)
• Solving coalitional resource games (Q2269130) (← links)
• Balanced-flow algorithm for path network planning in hierarchical spaces (Q2283024) (← links)
• Optimal \(K\)-node disruption on a node-capacitated network (Q2311104) (← links)
• A zero-space algorithm for negative cost cycle detection in networks (Q2466006) (← links)
• Two new algorithms for minimal cost flow problems (Q2560775) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• Quadratically Regularized Optimal Transport on Graphs (Q3174762) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q3196427) (← links)
• (Q3384766) (← links)
• Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
• A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
• Scaling: A general framework (Q3730337) (← links)
• Pickup and Delivery of Partial Loads with “Soft” Time Windows (Q3771948) (← links)
• The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm (Q3967334) (← links)
• An improved version of the out-of-kilter method and a comparative study of computer codes (Q4073126) (← links)
• Testing of a large-scale network optimization program (Q4171521) (← links)
• A note on primal network flow algorithms (Q4181571) (← links)
• New polynomial-time cycle-canceling algorithms for minimum-cost flows (Q4509383) (← links)
• (Q4636980) (← links)
• A bad network problem for the simplex method and other minimum cost flow algorithms (Q4775712) (← links)
• Engineering Negative Cycle Canceling for Wind Farm Cabling (Q5075800) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q5119385) (← links)
• More pathological examples for network flow problems (Q5181574) (← links)
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)
• On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem (Q5592829) (← links)
• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)