Labeling algorithms for multiple objective integer knapsack problems
Authors:
- José Rui FigueiraJFJosé Rui Figueira
- Gabriel TavaresGTGabriel Tavares
- Margaret M. WiecekMWMargaret M. Wiecek
- 1 April 2010
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 37 (4) , 700-711
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Solving efficiently the 0–1 multi-objective knapsack problemComputers & Operations Research, 2009
- Integrating partial optimization with scatter search for solving bi-criteria {0,1}-knapsack problemsEuropean Journal of Operational Research, 2007
- Analysis of a Multiobjective Evolutionary Algorithm on the 0–1 knapsack problemTheoretical Computer Science, 2006
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint methodEuropean Journal of Operational Research, 2006
- A scatter search method for bi-criteria {0,1}-knapsack problemsEuropean Journal of Operational Research, 2006
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case studyEuropean Journal of Operational Research, 2004
- Solving bicriteria 0–1 knapsack problems using a labeling algorithmComputers & Operations Research, 2003
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- A multiobjective programming approach for selecting non-independent transportation investment alternativesTransportation Research Part B: Methodological, 1996
- A Multiple Objective Approach to Capital BudgetingAccounting and Business Research, 1979