The following pages link to A network simplex method (Q4123079):
Displaying 47 items.
- A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
- On a particular quadratic network problem (Q580183) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Computational experience with exterior point algorithms for the transportation problem (Q702553) (← links)
- The biobjective undirected two-commodity minimum cost flow problem (Q707093) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- Modeling the satellite placement problem as a network flow problem with one side constraint (Q751497) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- On a multicriteria shortest path problem (Q790051) (← links)
- On the structure of the set bases of a degenerate point (Q795747) (← links)
- An infeasible (exterior point) simplex algorithm for assignment problems (Q811357) (← links)
- On using priced timed automata to achieve optimal scheduling (Q853729) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Representing inverses in pure network flow optimization (Q1068691) (← links)
- Degeneracy in transportation problems (Q1082263) (← links)
- A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
- An extended abstract of an indepth algorithmic and computational study for maximum flow problems (Q1148822) (← links)
- A network penalty method (Q1174423) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- The generalized alternating path algorithm for transportation problems (Q1245652) (← links)
- Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
- Combinatoric classes of the transportation problem and their properties (Q1312755) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
- A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
- The biobjective minimum cost flow problem (Q1578006) (← links)
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach (Q1652278) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- A network simplex algorithm with O(\(n\)) consecutive degenerate pivots (Q1866978) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- Solving the drift control problem (Q3466714) (← links)
- On cycling in the network simplex method (Q3664851) (← links)
- Efficient dual simplex algorithms for the assignment problem (Q3701192) (← links)
- A competitive (dual) simplex method for the assignment problem (Q3730345) (← links)
- Primal transportation and transshipment algorithms (Q3863694) (← links)
- The alternating basis algorithm for assignment problems (Q4159200) (← links)
- Testing of a large-scale network optimization program (Q4171521) (← links)
- (Q4636980) (← links)
- An algorithm for the biobjective integer minimum cost flow problem (Q5926033) (← links)
