Integrating partial optimization with scatter search for solving bi-criteria 0, 1-knapsack problems
From MaRDI portal
Publication:857299
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
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- scientific article; zbMATH DE number 2046100 (Why is no real title available?)
- scientific article; zbMATH DE number 1488081 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A bicriteria knapsack program for planning remediation of contaminated lightstation sites
- A bicriterion shortest path algorithm
- A label correcting approach for solving bicriterion shortest-path problems
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- Bi-criteria assignment problem
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Handbook of applied optimization
- Heuristic algorithms for the maximum diversity problem
- Intensification neighborhoods for local search methods
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Multi-objective optimization using evolutionary algorithms
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Scatter search. Methodology and implementation in C. With CD-ROM.
- 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
- The problem of the optimal biobjective spanning tree
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
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
- 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
- scientific article; zbMATH DE number 5282967 (Why is no real title available?)
- 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
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)
