inria-00184771, version 1

A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem

Stefan Balev () ¹, Nicola Yanev () ^2, 3, 4, Arnaud Fréville ^a, Rumen Andonov () ^b, 2

European Journal of Operational Research 186, 1 (2008) 63-76

• a –  LAMIH/ROI, University of Valenciennes
• b –  Université Rennes I
• 1:  Laboratoire d'informatique du Havre (LIH EA3219)
• Université du Havre
• 2:  SYMBIOSE (INRIA - IRISA)
• CNRS : UMR6074 – INRIA – INSA Rennes – Université de Rennes 1
• 3:  University of Sofia
• Bulgarian Academy of Sciences
• 4:  Department Probability, Operations Research and Statistics
• Sofia University

• Domain : Computer Science/Operations Research
  Computer Science/Discrete Mathematics
• Keywords : Dynamic programming – Integer programming – Multidimensional knapsack problem – Variable reduction – Heuristics

• inria-00184771, version 1
• http://hal.inria.fr/inria-00184771
• oai:hal.inria.fr:inria-00184771
• From: Rumen Andonov <>
• Submitted on: Thursday, 1 November 2007 17:22:25
• Updated on: Monday, 9 February 2009 13:07:31