Pages that link to "Item:Q3701192"

The following pages link to Efficient dual simplex algorithms for the assignment problem (Q3701192):

Displaying 28 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• A primal-dual simplex method for linear programs (Q688212) (← links)
• Signature classes of transportation polytopes (Q689115) (← links)
• Incremental assignment problem (Q865928) (← links)
• Sparse dual transportation polyhedra: Extreme points and signatures (Q911458) (← links)
• The auction algorithm for the transportation problem (Q918416) (← links)
• Improving the Hungarian assignment algorithm (Q1085073) (← links)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
• A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
• Personnel placement in a fuzzy environment (Q1185999) (← links)
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
• Solving linear bottleneck assignment problems via strong spanning trees (Q1200788) (← links)
• The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
• A simple dual algorithm for the generalised assignment problem (Q1365112) (← links)
• A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
• A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
• On solving a variation of the assignment problem (Q1390267) (← links)
• A relaxation column signature method for assignment problems (Q1814258) (← links)
• Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
• An efficient algorithm for the symmetric principal minor assignment problem (Q2341884) (← links)
• On finding and detecting efficient assignments in the case of multiple inputs and outputs (Q3568413) (← links)
• A competitive (dual) simplex method for the assignment problem (Q3730345) (← links)
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• On the initialization methods of an exterior point algorithm for the assignment problem (Q5747723) (← links)
• A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements (Q5944024) (← links)
• Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)