An algorithm for 0‐1 multiple‐knapsack problems

@inproceedings{Hung1978AnAF,
  title={An algorithm for 0‐1 multiple‐knapsack problems},
  author={Ming S. Hung and John C. Fisk},
  year={1978}
}
The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 24 CITATIONS

The 0 -1 multiple knapsack problem

VIEW 32 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Learn-As-You-Fly: A Distributed Algorithm for Joint 3D Placement and User Association in Multi-UAVs Networks

Hajar El Hammouti, Mustapha Benjillali, Basem Shihada, Mohamed-Slim Alouini
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

Revenue-oriented bandwidth allocation in optical OFDM intra data center networks

  • 2016 IEEE International Conference on Communications (ICC)
  • 2016
VIEW 2 EXCERPTS
CITES BACKGROUND

A novel artificial bee colony algorithm for the knapsack problem

  • 2012 International Symposium on Innovations in Intelligent Systems and Applications
  • 2012
VIEW 1 EXCERPT
CITES METHODS