T. A. J. Nicholson

Available identifiers

zbMath Open nicholson.t-a-jMaRDI QIDQ5532178

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5626420	1971-01-01	Paper
Extension of Dynamic Programming to Multi-plant Renewal	1971-01-01	Paper
A permutation procedure for job-shop scheduling	1968-01-01	Paper
A Boundary Method for Planar Travelling Salesman Problems	1968-01-01	Paper
A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems	1967-01-01	Paper
Finding the Shortest Route between Two Points in a Network	1966-01-01	Paper

Research outcomes over time

This page was built for person: T. A. J. Nicholson