Pages that link to "Item:Q1108928"
From MaRDI portal
The following pages link to A sequential dual simplex algorithm for the linear assignment problem (Q1108928):
Displaying 13 items.
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- A primal-dual simplex method for linear programs (Q688212) (← links)
- On dual solutions of the linear assignment problem (Q761971) (← links)
- A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
- A simple dual algorithm for the generalised assignment problem (Q1365112) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- The computational efficiency of Ji-Lee-Li algorithm for the assignment problem (Q2867325) (← links)
- (Q3696867) (← links)
- A competitive (dual) simplex method for the assignment problem (Q3730345) (← links)
- A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem (Q3815858) (← links)
- A dual forest algorithm for the assignment problem (Q3974955) (← links)
- A dual feasible forest algorithm for the linear assignment problem (Q3991697) (← links)
- On the initialization methods of an exterior point algorithm for the assignment problem (Q5747723) (← links)