Dyer M.E.

M.E. Dyer

Information about the author M.E. Dyer will soon be added to the site.
Found 5 papers in total
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...
On patching algorithms for random asymmetric travelling salesman problems
On patching algorithms for random asymmetric travelling salesman problems
1990
Let the arc-lengths L ij of a complete digraph on n vertices be independent uniform...
A randomized algorithm for fixed-dimensional linear programming
A randomized algorithm for fixed-dimensional linear programming
1989
The authors give a (Las Vegas) randomized algorithm for linear programming in a fixed...
Probabilistic analysis of the multidimensional knapsack problem
Probabilistic analysis of the multidimensional knapsack problem
1989
The authors analyse the multi-constraint zero-one knapsack problem, under the...
Papers per page: