An algorithm for then×n optimum assignment problem

DOI10.1007/BF01930982zbMath0445.65022OpenAlexW1978515690MaRDI QIDQ3890004

Kabekode V. S. Bhat, Bharat Kinariwala

Publication date: 1979

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01930982

zbMATH Keywords

algorithmcyclescostoptimum assignmentsystematic permutations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Algorithms in computer science (68W99)

Related Items (2)

Degree switching operations in networks and large scale systems assignment problems ⋮ The optimum assignments and a new heuristic approach for the traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the Assignment and Transportation Problems
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Theory of Output Set Assignments and Degree Switching Operations
• A fundamental problem in vehicle routing
• The shortest and the K-shortest routes as assignment problems
• Finding All the Elementary Circuits of a Directed Graph
• A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems
• An Appraisal of Some Shortest-Path Algorithms
• A Graph-Theoretic Approach to a Class of Integer-Programming Problems
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• On some techniques useful for solution of transportation network problems

This page was built for publication: An algorithm for then×n optimum assignment problem