19. An Upper Bound for the Integer Quadratic Multi-knapsack Problem

  1. Vangelis Th. Paschos
  1. Dominique Quadri,
  2. Eric Soutif and
  3. Pierre Tolla

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch19

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Quadri, D., Soutif, E. and Tolla, P. (2008) An Upper Bound for the Integer Quadratic Multi-knapsack Problem, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch19

Publication History

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

Keywords:

  • quadratic knapsack problem;
  • solution methods;
  • pegging algorithms;
  • management problem;
  • surrogate relaxation

Summary

This chapter contains sections titled:

  • Introduction

  • The algorithm of Djerdjour et al.

  • Improving the upper bound

  • An efficient heuristic to calculate a feasible solution

  • Computational results

  • Conclusion

  • Bibliography