Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality

@article{Gavish1985EfficientAF,
  title={Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality},
  author={Bezalel Gavish and Hasan Pirkul},
  journal={Math. Program.},
  year={1985},
  volume={31},
  pages={78-105}
}
The multiconstraint 0-1 knapsack problem is encountered when one has to decide how to use a knapsack with multiple resource constraints. Even though the single constraint version of this problem has received a lot of attention, the multiconstraint knapsack problem has been seldom addressed. This paper deals with developing an effective solution procedure for the multiconstraint knapsack problem. Various relaxations of the problem are suggested and theoretical relations between these relaxations… CONTINUE READING
88 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 88 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 26 references

An algorithm for optimal route selection in SNA networks

  • B. Gavish, S. L. Hantler
  • IEEE Transactions on Communications 31
  • 1983
2 Excerpts

Lagrangian relaxation and its uses in integer programming "

  • A. M. Geoffrion
  • Mathematical Programming Study
  • 1980

Pivot and complement - A heuristic for 0-1 programming

  • E. Balas, G. H. Martin
  • Management Science 26
  • 1980

' An upperbound for the zero - one knapsack problem and a branch and bound algorithm "

  • P. Toth
  • Siam Journal of Applied Mathematics
  • 1979

'Computational results with a branch and bound algorithm for the general knapsack problem

  • R i . Bulfin, P. G. Parker, C. M. Shetty
  • Naval Research Logistics Quarterly'
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…