Core problems in bi-criteria {0,1}-knapsack problems

Authors:
Carlos Gomes da Silva;João Clímaco;José Rui Figueira
Affiliations:
Escola Superior de Tecnologia e Gestão de Leiria, Morro do Lena, Alto Vieiro, 2401-951 Leiria, Portugal and INESC-Coimbra, Rua Antero de Quental, 199, 3000-033 Coimbra, Portugal;Faculdade de Economia da Universidade de Coimbra, Av. Dias da Silva, 165, 3004-512 Coimbra, Portugal and INESC-Coimbra, Rua Antero de Quental, 199, 3000-033 Coimbra, Portugal;CEG-IST, Center for Management Studies, Departamento de Engenharia e Gestão, Instituto Superior Técnico, Tagus Park, Av. Cavaco Silva, 2780-990 Porto Salvo, Portugal
Venue:
Computers and Operations Research
Year:
2008

Citing 6
Cited 5

A new algorithm for the 0-1 knapsack problem

Management Science
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem

Journal of Global Optimization
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science
Core Problems in Knapsack Algorithms

Operations Research
Solving bicriteria 0-1 knapsack problems using a labeling algorithm

Computers and Operations Research

The Multidimensional Knapsack Problem: Structure and Algorithms

INFORMS Journal on Computing
Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems

Journal of Global Optimization
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem

Computers and Operations Research
Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem

Computational Optimization and Applications
Finding all nondominated points of multi-objective integer programs

Journal of Global Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

The most efficient algorithms for solving the single-criterion {0,1}-knapsack problem are based on the core concept (i.e., based on a small number of relevant variables). But this concept is not used in problems with more than one criterion. The main purpose of this paper is to validate the existence of such a set of variables in bi-criteria {0-1}-knapsack instances. Numerical experiments were performed on five types of {0,1}-knapsack instances. The results are presented for the supported and non-supported solutions as well as for the entire set of efficient solutions. A description of an approximate and an exact method is also presented.