Skip to Main content Skip to Navigation
Conference papers

The Core Concept for 0/1 Integer Programming

Abstract : In this paper we examine an extension of the core concept for the 0/1 Multidimensional Knapsack Problem (MKP) towards general 0/1 Integer Programming (IP) by allowing negative profits, weights and capacities. The core concept provides opportunities for heuristically solving the MKP, achieving higher quality solutions and shorter run-times than general IP methods. We provide the theoretical foundations of the extended core concept and further provide computational experiments showing that we can achieve similar computational behavior for extended MKP instances with negative weights, profits and capacities.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Jakob Puchinger <>
Submitted on : Friday, April 8, 2016 - 12:05:50 PM
Last modification on : Tuesday, June 15, 2021 - 4:17:50 PM
Long-term archiving on: : Monday, November 14, 2016 - 11:06:04 PM


Files produced by the author(s)


  • HAL Id : hal-01299754, version 1



Sam Huston, Jakob Puchinger, Peter Stuckey. The Core Concept for 0/1 Integer Programming. Fourteenth Computing: The Australasian Theory Symposium (CATS2008), Jan 2008, Wollongong, Australia. ⟨hal-01299754⟩



Record views


Files downloads