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

DOI10.1134/S1064230711060153zbMATH Open1276.49019MaRDI QIDQ384665FDOQ384665

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

Publication date: 28 November 2013

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

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

zbMATH Keywords

optimizationassignment problemsequential modification

Mathematics Subject Classification ID

Decomposition methods (49M27)

Cites Work

• Many-dimensional knapsack problem of a special ladder structure
• Iterative functional modification method for solving a transportation problem
• Title not available (Why is that?)

Cited In (7)

• Decomposition method for solving a three-index planar assignment problem
• Title not available (Why is that?)
• Modified branch-and-bound method for solving a series of problems
• Title not available (Why is that?)
• Method for solving a convex integer programming problem
• 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)