Approach to finding the optimal solution in the assignment problem

DOI10.1007/BF02366586MaRDI QIDQ1364115zbMATH OpenFDO

Authors N. K. Timofeeva

Publication date 24 August 1997

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

locationassignmenttraveling salesmanassembly

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• A new look at the optimal assignment problem
• An optimal assignment problem with choice strategy
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
• On solving a variation of the assignment problem
• Solving assignment problem based on a mixed algorithm
• An algorithm for the assignment problem
• Solving the generalized assignment problem: an optimizing and heuristic approach
• An optimal solution for the budgets assignment problem
• scientific article; zbMATH DE number 4001850
• Solution of a class of generalized assignment problem

Cited in

(7)

• An optimal assignment problem with choice strategy
• A new look at the optimal assignment problem
• scientific article; zbMATH DE number 5629801 (Why is no real title available?)
• Solving assignment problems using best job method
• scientific article; zbMATH DE number 4158391 (Why is no real title available?)
• Subclasses of solvable problems from classes of combinatorial optimization problems
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM

This page was built for publication: Approach to finding the optimal solution in the assignment problem

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