A Two State Reduction Based Dynamic Programming Algorithm for the Bi-Objective 0-1 Knapsack Problem

Aiying Rong José Figueira 1 Margarida Vaz Pato
1 ORCHIDS - Operations research for Complex HybrId Decision Sytems
LORIA - NSS - Department of Networks, Systems and Services
Type de document :
Communication dans un congrès
The 21st International Conference on Multiple Criteria Decision Making - MCDM 2011, Jun 2011, Jyväskylä, Finland. 2011
Liste complète des métadonnées

https://hal.inria.fr/inria-00606424
Contributeur : Ammar Oulamara <>
Soumis le : mercredi 6 juillet 2011 - 14:27:32
Dernière modification le : mardi 24 avril 2018 - 13:36:27

Identifiants

  • HAL Id : inria-00606424, version 1

Collections

Citation

Aiying Rong, José Figueira, Margarida Vaz Pato. A Two State Reduction Based Dynamic Programming Algorithm for the Bi-Objective 0-1 Knapsack Problem. The 21st International Conference on Multiple Criteria Decision Making - MCDM 2011, Jun 2011, Jyväskylä, Finland. 2011. 〈inria-00606424〉

Partager

Métriques

Consultations de la notice

93