Pages that link to "Item:Q3722234"

The following pages link to On the simplex algorithm for networks and generalized networks (Q3722234):

Displaying 27 items.

• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• Polynomial dual network simplex algorithms (Q689130) (← links)
• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
• Active set algorithms for isotonic regression; a unifying framework (Q752010) (← links)
• New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels (Q839681) (← links)
• A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
• A note on a generalized network flow model for manufacturing process (Q1036893) (← links)
• Finding minimum-cost flows by double scaling (Q1184348) (← links)
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
• Studies of lexicography in the generalized network simplex method (Q1312763) (← links)
• A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
• A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
• A simplex algorithm for a class of Leontief flow problems (Q1381763) (← links)
• Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
• A network simplex algorithm with O(\(n\)) consecutive degenerate pivots (Q1866978) (← links)
• Flow constrained minimum cost flow problem (Q1937859) (← links)
• Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
• Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization (Q2783479) (← links)
• Solving the drift control problem (Q3466714) (← links)
• Anti-stalling pivot rules for the network simplex algorithm (Q3470267) (← links)
• Affirmative action algorithms (Q3725860) (← links)
• A competitive (dual) simplex method for the assignment problem (Q3730345) (← links)
• (Q4352220) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• (Q5856412) (← links)
• (Q5875370) (← links)
• On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs (Q6564294) (← links)