The following pages link to T. A. J. Nicholson (Q5532178):
Displaying 6 items.
- A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems (Q5532179) (← links)
- Finding the Shortest Route between Two Points in a Network (Q5535992) (← links)
- A permutation procedure for job-shop scheduling (Q5556108) (← links)
- A Boundary Method for Planar Travelling Salesman Problems (Q5567589) (← links)
- (Q5626420) (← links)
- Extension of Dynamic Programming to Multi-plant Renewal (Q5629441) (← links)
