The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
type: Item
instance of: scholarly article
title: The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
zbMATH Open document ID: 1193.90178
author: Carlos Gomes da Silva
author: Adiel Almeida Filho
author: Joao Carlos Namorado Climaco
published in: 4OR
publication date: 2010-08-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5774164
zbMATH Keywords: networks
zbMATH Keywords: small world measures
zbMATH Keywords: \(\{0, 1\}\) Multi-objective combinatorial optimization problems
MaRDI profile type: Publication
full work available at URL: s10288-009-0110-3
OpenAlex ID: W2093996760
cites work: The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study
cites work: Statistical mechanics of complex networks
cites work: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
cites work: Solving efficiently the 0-1 multi-objective knapsack problem
cites work: The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
cites work: Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
cites work: Connectedness of efficient solutions in multiple criteria combinatorial optimization
cites work: Q3267900
cites work: A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
cites work: Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
cites work: Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
cites work: Connectedness of efficient solutions in multiple objective combinatorial optimization
cites work: Q4945108
cites work: Q3993418
cites work: Q3815146
cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
cites work: Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
DOI: 10.1007/S10288-009-0110-3
description: scientific article; zbMATH DE number 5774164