Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C29 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6597007 / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-objective optimization
Property / zbMATH Keywords: multi-objective optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
integer knapsack problems
Property / zbMATH Keywords: integer knapsack problems / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
bound sets
Property / zbMATH Keywords: bound sets / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MOTGA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091365600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using support vector machines to learn the efficient set in multiple objective discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving efficiently the 0-1 multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving bicriteria 0--1 knapsack problems using a labeling algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound sets for biobjective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling algorithms for multiple objective integer knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core problems in bi-criteria \(\{0,1\}\)-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for a class of knapsack problems with binary weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria knapsack program for planning remediation of contaminated lightstation sites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithm for bi-objective 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective meta-heuristics: An overview of the current state-of-the-art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relocation problems arising in conservation biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach to discrete mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective integer programming: a general approach for generating all non-dominated solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Beam Search for Multicriteria Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction dynamic programming algorithm for the bi-objective integer knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the Discrete Efficient Frontier to the Capital Budgeting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction algorithm for integer multiple objective linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for finding the set of non-dominated vectors for multiple objective integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐objective combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:54, 12 July 2024

scientific article
Language Label Description Also known as
English
Dynamic programming algorithms for the bi-objective integer knapsack problem
scientific article

    Statements

    Dynamic programming algorithms for the bi-objective integer knapsack problem (English)
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    multi-objective optimization
    0 references
    integer knapsack problems
    0 references
    dynamic programming
    0 references
    bound sets
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers