scientific article; zbMATH DE number 176471
From MaRDI portal
Publication:4035633
zbMATH Open0784.90091MaRDI QIDQ4035633FDOQ4035633
Authors: Mustafa Akgül 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
- A dual feasible forest algorithm for the linear assignment problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- scientific article; zbMATH DE number 17627
- A sequential dual simplex algorithm for the linear assignment problem
- scientific article; zbMATH DE number 3989103
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (26)
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- On the linear assignment problem for special matrices
- Title not available (Why is that?)
- Improving the Hungarian assignment algorithm
- Title not available (Why is that?)
- Algorithm for the minimax assignment problem with a sparse rectangular matrix
- Remarks on implementation of O ( n 1/2 τ) assignment algorithms
- Efficient dual simplex algorithms for the assignment problem
- Threshold assignment algorithm
- The assignment problem
- An algorithm for ranking assignments using reoptimization
- Analysis and automatization of the Edmonds algorithm for the assignment problem
- Primal-dual algorithms for the assignment problem
- Technical Note—A Note on Parametric Analysis in Linear Assignment
- A fast parametric assignment algorithm with applications in max-algebra
- Solving linear bottleneck assignment problems via strong spanning trees
- A genuinely polynomial primal simplex algorithm for the assignment problem
- AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM
- A note on the parity assignment problem
- Title not available (Why is that?)
- Worst case examples of an exterior point algorithm for the assignment problem
- A heuristic for the time constrained asymmetric linear sum assignment problem
- A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables
- Title not available (Why is that?)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Algorithms and codes for dense assignment problems: The state of the art
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035633)
