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.
Type de document :
Communication dans un congrès
Fourteenth Computing: The Australasian Theory Symposium (CATS2008), Jan 2008, Wollongong, Australia. 〈http://crpit.com/Vol77.html〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01299754
Contributeur : Jakob Puchinger <>
Soumis le : vendredi 8 avril 2016 - 12:05:50
Dernière modification le : dimanche 22 janvier 2017 - 12:13:47
Document(s) archivé(s) le : lundi 14 novembre 2016 - 23:06:04

Fichier

cats2008.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01299754, version 1

Collections

Citation

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. 〈http://crpit.com/Vol77.html〉. 〈hal-01299754〉

Partager

Métriques

Consultations de la notice

71

Téléchargements de fichiers

23