A sequential dual simplex algorithm for the linear assignment problem
DOI10.1016/0167-6377(88)90082-XzbMATH Open0654.90053MaRDI QIDQ1108928FDOQ1108928
Authors: Mustafa Akgül 
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Recommendations
- Efficient dual simplex algorithms for the assignment problem
- On dual solutions of the linear assignment problem
- A competitive (dual) simplex method for the assignment problem
- A simple dual algorithm for the generalised assignment problem
- A Dual Simplex Algorithm for Piecewise-Linear Programming
- scientific article; zbMATH DE number 56167
- A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
- scientific article; zbMATH DE number 3922378
- A dual version of Tardos's algorithm for linear programming
- scientific article; zbMATH DE number 515938
linear assignment problemtransshipmentdual simplex methoddirected bipartite graphdual strongly feasible trees
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Title not available (Why is that?)
- Efficient dual simplex algorithms for the assignment problem
- Signature Methods for the Assignment Problem
- A network simplex method
- The alternating basis algorithm for assignment problems
- A competitive (dual) simplex method for the assignment problem
Cited In (17)
- On dual solutions of the linear assignment problem
- On the initialization methods of an exterior point algorithm for the assignment problem
- Efficient dual simplex algorithms for the assignment problem
- A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
- A simple dual algorithm for the generalised assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A competitive (dual) simplex method for the assignment problem
- Title not available (Why is that?)
- A strongly polynomial simplex method for the linear fractional assignment problem
- A genuinely polynomial primal simplex algorithm for the assignment problem
- A primal-dual simplex method for linear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The computational efficiency of Ji-Lee-Li algorithm for the assignment problem
- Algorithms and codes for dense assignment problems: The state of the art
- Title not available (Why is that?)
This page was built for publication: A sequential dual simplex algorithm for the linear assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108928)
