A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems

DOI10.1093/imamat/3.4.362zbMath0152.38304OpenAlexW1968766664MaRDI QIDQ5532179

Publication date: 1967

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/3.4.362

zbMATH Keywords

operations research

Related Items (3)

Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem ⋮ An algorithm for then×n optimum assignment problem ⋮ The optimum assignments and a new heuristic approach for the traveling salesman problem

This page was built for publication: A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems