Linear assignment procedures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 515939 (Why is no real title available?)
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- An efficient cost scaling algorithm for the assignment problem
- An in-core/out-of-core method for solving large scale assignment problems
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Linear and semi-assignment problems: A core oriented approach
- On some techniques useful for solution of transportation network problems
Cited in
(8)- Solving the rectangular assignment problem and applications
- Solving the \(k\)-cardinality assignment problem by transformation
- Technical Note—A Note on Parametric Analysis in Linear Assignment
- On dual solutions of the linear assignment problem
- Linear assignment problems in combinatorial optimization
- Assigning agents to a line
- A heuristic for the time constrained asymmetric linear sum assignment problem
- An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
This page was built for publication: Linear assignment procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610146)