Greedy algorithms for a class of knapsack problems with binary weights (Q1761999): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on the 0--1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming and Capital Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / 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: Q4945108 / 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: 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: Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization / 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: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiobjective Traveling Salesman Problem: A Survey and a New Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning tree problems with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained optimization using multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of efficient solutions in multiple objective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of efficient solutions in multiple criteria combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sequential knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local optima in multiobjective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075630 / rank
 
Normal rank

Latest revision as of 22:05, 5 July 2024

scientific article
Language Label Description Also known as
English
Greedy algorithms for a class of knapsack problems with binary weights
scientific article

    Statements

    Greedy algorithms for a class of knapsack problems with binary weights (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    knapsack problem
    0 references
    binary optimization
    0 references
    multiple criteria unconstrained optimization
    0 references
    connectedness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers