Core problems in bi-criteria \0,1\-knapsack problems
From MaRDI portal
Publication:2468486
Recommendations
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Core problems in knapsack algorithms
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- scientific article; zbMATH DE number 2130001
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1149800 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A New Algorithm for the 0-1 Knapsack Problem
- A combined approach to solve binary multicriteria problems
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- An Algorithm for Large Zero-One Knapsack Problems
- An algorithm for the solution of the 0-1 knapsack problem
- An expanding-core algorithm for the exact 0-1 knapsack problem
- Core problems in knapsack algorithms
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Linear multiple objective programs with zero–one variables
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving zero-one multiple objective programs through implicit enumeration
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
Cited in
(19)- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Core problems in knapsack algorithms
- An optimization model for reuse scenario selection considering reliability and cost in software product line development
- 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
- Finding all nondominated points of multi-objective integer programs
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Robust efficiency measures for linear knapsack problem variants
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
This page was built for publication: Core problems in 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 Q2468486)
