An algorithm for then×n optimum assignment problem

DOI10.1007/BF01930982zbMATH Open0445.65022OpenAlexW1978515690MaRDI QIDQ3890004FDOQ3890004

Authors: 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

algorithmcostcyclesoptimum assignmentsystematic permutations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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

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