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

Aiying Rong; José Figueira; Margarida Vaz Pato

Conference Papers Year : 2011

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

, (1) ,

1

Aiying Rong

Function : Author

José Figueira

Function : Author
PersonId : 895299

Operations research for Complex HybrId Decision Sytems

Margarida Vaz Pato

Function : Author

Ammar Oulamara : Connect in order to contact the contributor

https://inria.hal.science/inria-00606424

Submitted on : Wednesday, July 6, 2011-2:27:32 PM

Last modification on : Monday, September 11, 2023-5:41:18 PM

Dates and versions

inria-00606424 , version 1 (06-07-2011)

Identifiers

HAL Id : inria-00606424 , version 1

Cite

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, Univ. of Jyväskylä, Jun 2011, Jyväskylä, Finland. ⟨inria-00606424⟩

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

Dates and versions

Identifiers

Cite

Export

Collections

Share