A relaxation column signature method for assignment problems
From MaRDI portal
Publication:1814258
DOI10.1016/0377-2217(91)90243-OzbMath0741.90047MaRDI QIDQ1814258
Publication date: 25 June 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (3)
On the initialization methods of an exterior point algorithm for the assignment problem ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Signature classes of transportation polytopes
Cites Work
- Faces of dual transportation polyhedra
- The Hirsch Conjecture for Dual Transportation Polyhedra
- Efficient dual simplex algorithms for the assignment problem
- Signature Methods for the Assignment Problem
- A competitive (dual) simplex method for the assignment problem
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems
- A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
- Solving the Assignment Problem by Relaxation
This page was built for publication: A relaxation column signature method for assignment problems
