A branch and bound algorithm for solving the multiple-choice knapsack problem
Dyer, M.E., Kayal, N., Walker, J.
Published in Journal of computational and applied mathematics (01.01.1984)
Published in Journal of computational and applied mathematics (01.01.1984)
Get full text
Journal Article
A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice knapsack problem
Dyer, M.E., Riha, W.O., Walker, J.
Published in Journal of computational and applied mathematics (20.03.1995)
Published in Journal of computational and applied mathematics (20.03.1995)
Get full text
Journal Article
Analysis of heuristics for finding a maximum weight planar subgraph
Dyer, M.E., Foulds, L.R., Frieze, A.M.
Published in European journal of operational research (01.04.1985)
Published in European journal of operational research (01.04.1985)
Get full text
Journal Article
An Extendable Approach to Computer-Aided Software Requirements Engineering
Bell, T.E., Bixler, D.C., Dyer, M.E.
Published in IEEE transactions on software engineering (01.01.1977)
Published in IEEE transactions on software engineering (01.01.1977)
Get full text
Journal Article