Dynamic programming algorithms for the bi-objective integer knapsack problem
From MaRDI portal
Publication:299843
DOI10.1016/j.ejor.2013.11.032zbMath1338.90377OpenAlexW2091365600MaRDI QIDQ299843
Aiying Rong, José Rui Figueira
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.032
Integer programming (90C10) Multi-objective and goal programming (90C29) Dynamic programming (90C39)
Related Items (6)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Network Models for Multiobjective Discrete Optimization ⋮ A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem ⋮ Multi-objective branch and bound ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- A two state reduction based dynamic programming algorithm 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
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Bound sets for biobjective combinatorial optimization problems
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- Using support vector machines to learn the efficient set in multiple objective discrete optimization
- Exact algorithm for bi-objective 0-1 knapsack problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Labeling algorithms for multiple objective integer knapsack problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- A reduction algorithm for integer multiple objective linear programs
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- 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
- Greedy algorithms for a class of knapsack problems with binary weights
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A survey and annotated bibliography of multiobjective combinatorial optimization
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Relocation problems arising in conservation biology
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Proper efficiency and the theory of vector maximization
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- On Beam Search for Multicriteria Combinatorial Optimization Problems
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- A hybrid approach to discrete mathematical programming
- Multi‐objective combinatorial optimization problems: A survey
- Multicriteria Optimization
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
This page was built for publication: Dynamic programming algorithms for the bi-objective integer knapsack problem
