A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem

@article{Taniguchi2009AVP,
  title={A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem},
  author={Fumiaki Taniguchi and Takeo Yamada and Seiji Kataoka},
  journal={Int. J. Comput. Math.},
  year={2009},
  volume={86},
  pages={779-793}
}
We are concerned with a variation of the knapsack problem, the bi-objective max-min knapsack problem (BKP), where the values of items differ under two possible scenarios. We give a heuristic algorithm and an exact algorithm to solve this problem. In particular, we introduce a surrogate relaxation to derive upper and lower bounds very quickly, and apply the pegging test to reduce the size of BKP. We also exploit this relaxation to obtain an upper bound in the branch-andbound algorithm to solve… CONTINUE READING