Parallel implementation of an exact two-phase method for the biobjective knapsack problem
From MaRDI portal
Recommendations
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Fourier-Motzkin elimination method in MOLP problems
- On the modified interior point algorithm for solving multi-objective linear programming problems
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3568375 (Why is no real title available?)
- scientific article; zbMATH DE number 2160609 (Why is no real title available?)
- scientific article; zbMATH DE number 915988 (Why is no real title available?)
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- A New Algorithm for the 0-1 Knapsack Problem
- A parallel two-list algorithm for the knapsack problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Bicriteria Transportation Problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- New reduction strategy in the biobjective knapsack problem
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving efficiently the 0-1 multi-objective knapsack problem
- Solving knapsack problems on GPU
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
This page was built for publication: Parallel implementation of an exact two-phase method for the biobjective knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658451)
