Heuristics for multiple knapsack problem

@inproceedings{Fidanova2005HeuristicsFM,
  title={Heuristics for multiple knapsack problem},
  author={Stefka Fidanova},
  booktitle={IADIS AC},
  year={2005}
}
The Multiple Knapsack problem (MKP) is a hard combinatorial optimization problem with large application, which embraces many practical problems from different domains, like cargo loading, cutting stock, bin-packing, financial and other management, etc. It also arise as a subproblem in several more complex problems like vehicle routing problem and the algorithms to solve these problems will benefit from any improvement in the field of MKP. The aim of this paper is to compare different kind of… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-9 of 9 references

A mixtures of dynamic programming and branch-and-bound for the subset-sum problem

  • S. Martello, P. Toth
  • Management Science,
  • 1984
2 Excerpts

New direction in cryptography

  • W Diffe, E HellmanM.
  • IEEE Trans, Inf. Theory, IT -
  • 1976
1 Excerpt

Heuristic for general inter programming

  • G. Kochemberger, G. McCarl, F. Wymann
  • J. of Decision Sciences
  • 1974
2 Excerpts

Similar Papers

Loading similar papers…