Method of sequential modification of the objective function in the assignment problem

DOI10.1134/S1064230711060153MaRDI QIDQ384665zbMATH OpenFDO

Authors D. I. Kuzovlev, A. P. Tizik, Yu. P. Treskov

Publication date 28 November 2013

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

optimizationassignment problemsequential modification

Mathematics Subject Classification ID

Decomposition methods (49M27)

Recommendations

• The recurrent method to solve the assignment problem
• Iterative functional modification method for solving a transportation problem
• A new method of solving assignment problems -- the target value submatrix method
• Decomposition method for solving a three-index planar assignment problem
• A new algorithm for the assignment problem: An alternative to the Hungarian method

Cites work

• scientific article; zbMATH DE number 3864992 (Why is no real title available?)
• Iterative functional modification method for solving a transportation problem
• Many-dimensional knapsack problem of a special ladder structure

Cited in

(17)

• A ranking method for the assignment problem with multiple optimal solutions
• Decomposition method for solving a three-index planar assignment problem
• scientific article; zbMATH DE number 4027176 (Why is no real title available?)
• The recurrent method to solve the assignment problem
• A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
• A note of reduced dimension optimization algorithm of assignment problem
• scientific article; zbMATH DE number 49116 (Why is no real title available?)
• Modified branch-and-bound method for solving a series of problems
• Iterative functional modification method for solving a transportation problem
• scientific article; zbMATH DE number 33840 (Why is no real title available?)
• New congruence method towards assignment problem
• Ones assignment method for solving assignment problems
• A new method of solving assignment problems -- the target value submatrix method
• Method for solving a convex integer programming problem
• Goal programming in the context of the assignment problem and a computationally effective solution method
• Decomposition method for solving the three-index problem of effective shooting
• The partial orthogonalization process and its application to the optimal assignment problem

This page was built for publication: Method of sequential modification of the objective function in the assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384665)