scientific article; zbMATH DE number 176471

MaRDI QIDQ4035633zbMATH OpenFDO

Authors Mustafa Akgül

Publication date 18 May 1993

zbMATH Keywords

surveyshortest pathpolynomial algorithmslinear assignment

Mathematics Subject Classification ID

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)

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

Cited in

(28)

• Two classes of quadratic assignment problems that are solvable as linear assignment problems
• On the linear assignment problem for special matrices
• scientific article; zbMATH DE number 4130203 (Why is no real title available?)
• Improving the Hungarian assignment algorithm
• scientific article; zbMATH DE number 3989103 (Why is no real title available?)
• 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
• Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic 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
• A genuinely polynomial primal simplex algorithm for the assignment problem
• Solving linear bottleneck assignment problems via strong spanning trees
• AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM
• A note on the parity assignment problem
• Worst case examples of an exterior point algorithm for the assignment problem
• A heuristic for the time constrained asymmetric linear sum assignment problem
• scientific article; zbMATH DE number 515939 (Why is no real title available?)
• A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables
• scientific article; zbMATH DE number 3982944 (Why is no real title available?)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Algorithms and codes for dense assignment problems: The state of the art
• Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model

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)