A two state reduction based dynamic programming algorithm for the bi-objective 01 knapsack problem

Computers and Mathematics with Applications

Journal Article

A. Rong

M.V. Pato

Publication

Year of publication: 2011

Volume: 62

Issue: 8

Pages: 2913-2930

Sustainable Development Goals

Identifiers

Other: 2-s2.0-80053359375

Locators

DOI: 10.1016/j.camwa.2011.07.067

Alternative Titles

Contacts

CEG-IST - Centro de Estudos de Gestão
Instituto Superior Técnico

Av. Rovisco Pais, 1049 - 001 Lisboa
Tel: +351 21 841 77 29 (ext. 1729)
Fax: +351 21 841 79 79
E-mail: cegist@tecnico.ulisboa.pt

Sponsored by

FCT logo

 

 

Financed by Portuguese funds through the FCT - Foundation for Science and Technology, I.P., under the projects UIDB/00097/2020 and UIDP/00097/2020

Host Institution

IST Lisboa