Integrating partial optimization with scatter search for solving bi-criteria 0, 1-knapsack problems
From MaRDI portal
Publication:857299
DOI10.1016/J.EJOR.2005.10.013zbMATH Open1102.90046OpenAlexW2128555856MaRDI QIDQ857299FDOQ857299
Authors: José Rui Figueira, Carlos Gomes da Silva, Joao Carlos Namorado Climaco 
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
Recommendations
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- Scatter search for the 0-1 multidimensional knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- scientific article; zbMATH DE number 5282967
- A hybrid dynamic programming approach to the biobjective binary knapsack problem
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A label correcting approach for solving bicriterion shortest-path problems
- Multi-objective optimization using evolutionary algorithms
- Handbook of applied optimization
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Title not available (Why is that?)
- A bicriterion shortest path algorithm
- 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
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Title not available (Why is that?)
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Heuristic algorithms for the maximum diversity problem
- The problem of the optimal biobjective spanning tree
- Bi-criteria assignment problem
- Intensification neighborhoods for local search methods
Cited In (15)
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- Scatter search for the 0-1 multidimensional knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- Title not available (Why is that?)
- Labeling algorithms for multiple objective integer knapsack problems
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Greedy algorithms for a class of knapsack problems with binary weights
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
Uses Software
This page was built for publication: Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857299)
