Pages that link to "Item:Q4159200"

The following pages link to The alternating basis algorithm for assignment problems (Q4159200):

Displaying 44 items.

• A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← 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)
• Basis properties and algorithmic specializations for GUB transformed networks (Q786644) (← links)
• An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems (Q792216) (← links)
• An infeasible (exterior point) simplex algorithm for assignment problems (Q811357) (← links)
• Bilevel time minimizing assignment problem (Q865542) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• The auction algorithm for the transportation problem (Q918416) (← links)
• A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
• The assignment problem under categorized jobs (Q1054638) (← links)
• An efficient algorithm for the bipartite matching problem (Q1069866) (← links)
• Degeneracy in transportation problems (Q1082263) (← links)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
• A Lagrangean relaxation method for the constrained assignment problem (Q1086162) (← links)
• Primal-dual algorithms for the assignment problem (Q1095790) (← links)
• A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
• The generalized alternating path algorithm for transportation problems (Q1245652) (← links)
• Determining dominant wind directions (Q1268424) (← links)
• Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
• A variant of time minimizing assignment problem (Q1303581) (← links)
• A variation of the assignment problem (Q1309926) (← links)
• Selected bibliography on degeneracy (Q1312748) (← links)
• Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
• The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
• Max-min matching problems with multiple assignments (Q1359459) (← links)
• A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
• Bottleneck assignment problems under categorization (Q1821678) (← links)
• Algorithm for the solution of the assignment problem for sparse matrices (Q1838425) (← links)
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
• The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
• Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
• A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164) (← links)
• An extended assignment problem considering multiple inputs and outputs (Q2470282) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• On cycling in the network simplex method (Q3664851) (← links)
• A unified framework for primal-dual methods in minimum cost network flow problems (Q3683845) (← 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)
• A new algorithm for the assignment problem (Q3911685) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• Fast primal-dual update against local weight update in linear assignment problem and its application (Q6072219) (← links)