A new algorithm for solving a special matching problem with a general form value function under constraints
From MaRDI portal
(Redirected from Publication:2287164)
Recommendations
- A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
- A new algorithm for general matching problems using network flow subproblems
- The recurrent method to solve the assignment problem
- The constrained minimax linear assignment problem
- An efficient algorithm for the bipartite matching problem
Cites work
- A genetic approach to the quadratic assignment problem
- A new algorithm for the assignment problem
- Assignment Problems
- Assignment Problems and the Location of Economic Activities
- scientific article; zbMATH DE number 6118218 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3361648 (Why is no real title available?)
- P-Complete Approximation Problems
- The alternating basis algorithm for assignment problems
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- The Wiener maximum quadratic assignment problem
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
This page was built for publication: A new algorithm for solving a special matching problem with a general form value function under constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287164)