Solving efficiently the 0–1 multi-objective knapsack problem
- 1 January 2009
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (1) , 260-279
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Bound sets for biobjective combinatorial optimization problemsComputers & Operations Research, 2007
- Integrating partial optimization with scatter search for solving bi-criteria {0,1}-knapsack problemsEuropean Journal of Operational Research, 2007
- A scatter search method for bi-criteria {0,1}-knapsack problemsEuropean Journal of Operational Research, 2006
- Solving bicriteria 0–1 knapsack problems using a labeling algorithmComputers & Operations Research, 2003
- Approximating Multiobjective Knapsack ProblemsManagement Science, 2002
- A bicriteria knapsack program for planning remediation of contaminated lightstation sitesEuropean Journal of Operational Research, 2002
- A survey and annotated bibliography of multiobjective combinatorial optimizationOR Spectrum, 2000
- Relocation problems arising in conservation biologyComputers & Mathematics with Applications, 1999
- A multiobjective programming approach for selecting non-independent transportation investment alternativesTransportation Research Part B: Methodological, 1996
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975