Exact algorithm for bi-objective 0-1 knapsack problem (Q990717): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and algorithms for linear multiple objective programs with zero–one variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-one multiple objective programs through implicit enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for generating all efficient solutions of 0-1 multi-objective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / 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: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank

Latest revision as of 04:07, 3 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithm for bi-objective 0-1 knapsack problem
scientific article

    Statements

    Exact algorithm for bi-objective 0-1 knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    bi-objective 0-1 knapsack problem
    0 references
    multiple objective mathematical programming
    0 references
    linear programming
    0 references
    0 references