Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems

DOI10.1016/j.ejor.2005.10.013zbMath1102.90046OpenAlexW2128555856MaRDI QIDQ857299

José Rui Figueira, Joao Carlos Namorado Climaco, Carlos Gomes da Silva

Publication date: 14 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.013

zbMATH Keywords

combinatorial optimizationmetaheuristicsexact methodsscatter searchbi-criteria Knapsack

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (11)

Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ Multi-objective variable neighborhood search: an application to combinatorial optimization problems ⋮ Solving efficiently the 0-1 multi-objective knapsack problem ⋮ Core problems in bi-criteria \(\{0,1\}\)-knapsack problems ⋮ Greedy algorithms for a class of knapsack problems with binary weights ⋮ The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Uses Software

• Knapsack
• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bi-criteria assignment problem
• A bicriterion shortest path algorithm
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• A bicriteria knapsack program for planning remediation of contaminated lightstation sites
• The problem of the optimal biobjective spanning tree
• Scatter search. Methodology and implementation in C. With CD-ROM.
• A label correcting approach for solving bicriterion shortest-path problems
• A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
• Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Heuristic algorithms for the maximum diversity problem
• MOSA method: a tool for solving multiobjective combinatorial optimization problems

This page was built for publication: Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems