Walker J.

J. Walker

Information about the author J. Walker will soon be added to the site.
Found 7 papers in total
A sequential discovery sampling procedure
A sequential discovery sampling procedure
2002
A sequential discovery sampling procedure is to randomly sample and audit one record...
Vector maximisation over a finite set of alternatives
Vector maximisation over a finite set of alternatives
1998
This paper examines the computational complexity of solving the vector maximisation...
An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
1997
This paper presents an efficient algorithm for solving the Lagrangean dual of...
A hybrid dynamic-programming branch-and-bound algorithm for the multiple-choice knapsack-problem
A hybrid dynamic-programming branch-and-bound algorithm for the multiple-choice knapsack-problem
1995
Dynamic programming and branch-and-bound methodologies are combined to produce a...
A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice kanpsack problem
A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice kanpsack problem
1995
Dynamic programming and branch-and-bound methodologies are combined to produce a...
Optimality regions and penalty analysis of the parameter space for machine replacement problems
Optimality regions and penalty analysis of the parameter space for machine replacement problems
1994
A simple method is presented for developing optimality regions and penalty analysis of...
The single-period inventory problem with triangular demand distribution
The single-period inventory problem with triangular demand distribution
1993
A simple method is presented for determining ‘closed-form’ solutions for...
Papers per page: