Login / Signup
A pseudopolynomial network flow formulation for exact knapsack separation.
E. Andrew Boyd
Published in:
Networks (1992)
Keyphrases
</>
network flow
network flow formulation
knapsack problem
dynamic programming
upper bound
packing problem
optimal solution
feasible solution