Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: A bicriterion shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4451071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / 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: Heuristic algorithms for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / 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: A bicriteria knapsack program for planning remediation of contaminated lightstation sites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search. Methodology and implementation in C. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-criteria assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of the optimal biobjective spanning tree / 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 label correcting approach for solving bicriterion shortest-path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934175 / 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

Latest revision as of 11:40, 25 June 2024

scientific article
Language Label Description Also known as
English
Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
scientific article

    Statements

    Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (English)
    0 references
    14 December 2006
    0 references
    0 references
    metaheuristics
    0 references
    exact methods
    0 references
    scatter search
    0 references
    bi-criteria Knapsack
    0 references
    combinatorial optimization
    0 references
    0 references