scientific article; zbMATH DE number 17627
From MaRDI portal
Publication:3974955
Recommendations
- A dual feasible forest algorithm for the linear assignment problem
- scientific article; zbMATH DE number 1795712
- A sequential dual simplex algorithm for the linear assignment problem
- Efficient dual simplex algorithms for the assignment problem
- A new algorithm for the assignment problem: An alternative to the Hungarian method
Cited in
(13)- Analysis and automatization of the Edmonds algorithm for the assignment problem
- Exterior point simplex-type algorithms for linear and network optimization problems
- scientific article; zbMATH DE number 176471 (Why is no real title available?)
- Worst case examples of an exterior point algorithm for the assignment problem
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints
- scientific article; zbMATH DE number 515938 (Why is no real title available?)
- Computational experience with exterior point algorithms for the transportation problem
- Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems
- Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems
- Improving bipartite graph edit distance approximation using various search strategies
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm
- A simplex-based labelling algorithm for the linear fractional assignment problem
- scientific article; zbMATH DE number 1795712 (Why is no real title available?)
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 Q3974955)
