Pages that link to "Item:Q1396922"
From MaRDI portal
The following pages link to On dual minimum cost flow algorithms (Q1396922):
Displaying 28 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- Minimum-cost single-source 2-splittable flow (Q1041715) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs (Q1317479) (← links)
- On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745) (← links)
- Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← links)
- Minimum cut problem using bases of extended polymatroids (Q1385774) (← links)
- Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (Q1889860) (← links)
- On a fractional minimal cost flow problem on networks (Q1926638) (← links)
- A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← links)
- Problems of synthesis of connected networks with respect to isomorphic subgraphs (Q2574245) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
- A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS (Q3202103) (← links)
- Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
- A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM (Q3783057) (← links)
- Dual Algorithms for Pure Network Problems (Q3812008) (← links)
- Efficient algorithms for the reverse shortest path problem on trees under the hamming distance (Q4987673) (← links)
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← links)
- The blocking job shop with rail-bound transportation (Q5963615) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
- An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions (Q6534770) (← links)
