The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q286527 / rank
Normal rank
 
Property / author
 
Property / author: Joao Carlos Namorado Climaco / 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.1007/s10288-009-0110-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093996760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / 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: Solving efficiently the 0-1 multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization / 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: Connectedness of efficient solutions in multiple criteria combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / 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: Connectedness of efficient solutions in multiple objective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:26, 3 July 2024

scientific article
Language Label Description Also known as
English
The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
scientific article

    Statements

    The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (English)
    0 references
    0 references
    23 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    networks
    0 references
    small world measures
    0 references
    \(\{0, 1\}\) Multi-objective combinatorial optimization problems
    0 references
    0 references