Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem

DOI10.1007/978-3-319-16468-7_7zbMath1421.90175arXiv1502.03699OpenAlexW2131535703MaRDI QIDQ5194626

Yong Wang, Jun He, Yuren Zhou

Publication date: 16 September 2019

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03699

zbMATH Keywords

knapsack problemevolutionary algorithmapproximation ratiomulti-objective optimisationsolution quality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using multi-objective evolutionary algorithms for single-objective optimization
• Minimum spanning trees made easier via multi-objective optimization
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• The Design of Approximation Algorithms

This page was built for publication: Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem