Dynamic programming algorithms for the bi-objective integer knapsack problem
From MaRDI portal
Recommendations
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- A dynamic programming algorithm for the bilevel Knapsack problem
- A hybrid dynamic programming approach to the biobjective binary knapsack problem
- A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem
- scientific article; zbMATH DE number 1423920
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- scientific article; zbMATH DE number 536590
- Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
- A dynamic programming approach to solving the multiple choice knapsack problem
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 1488081 (Why is no real title available?)
- scientific article; zbMATH DE number 1530371 (Why is no real title available?)
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- A bicriteria knapsack program for planning remediation of contaminated lightstation sites
- A hybrid approach to discrete mathematical programming
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- A reduction algorithm for integer multiple objective linear programs
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- 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
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Bound sets for biobjective combinatorial optimization problems
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Exact algorithm for bi-objective 0-1 knapsack problem
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Greedy algorithms for a class of knapsack problems with binary weights
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Labeling algorithms for multiple objective integer knapsack problems
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- Multicriteria Optimization
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Multi‐objective combinatorial optimization problems: A survey
- On beam search for multicriteria combinatorial optimization problems
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Proper efficiency and the theory of vector maximization
- Relocation problems arising in conservation biology
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving efficiently the 0-1 multi-objective 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
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- 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
- Using support vector machines to learn the efficient set in multiple objective discrete optimization
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
Cited in
(24)- A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem
- BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- scientific article; zbMATH DE number 6869279 (Why is no real title available?)
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- Multi-objective branch and bound
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- An improved algorithm for solving biobjective integer programs
- Bi-dimensional knapsack problems with one soft constraint
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- A hybrid dynamic programming approach to the biobjective binary knapsack problem
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Dynamic programming for a biobjective search problem in a line
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- Network Models for Multiobjective Discrete Optimization
- A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem
- Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
- Exact algorithm for bi-objective 0-1 knapsack problem
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- Finding algorithm of optimal subset structure based on the Pareto layers in the knapsack problem
This page was built for publication: Dynamic programming algorithms for the bi-objective integer knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299843)
