A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.camwa.2011.07.067 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985999411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / 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: Relocation problems arising in conservation biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective model for environmental investment decision making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria facility location problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945108 / 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: Labeling algorithms for multiple objective integer knapsack problems / 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 bicriteria 0--1 knapsack problems using a labeling algorithm. / 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: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded knapsack problem: Dynamic programming revisited / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:01, 4 July 2024

scientific article
Language Label Description Also known as
English
A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
scientific article

    Statements

    A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2012
    0 references
    bi-objective knapsack instances
    0 references
    multi-objective optimization
    0 references
    dynamic programming
    0 references
    state reduction
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references