Solving 0-1 knapsack problems based on amoeboid organism algorithm
type: Item
instance of: scholarly article
title: Solving 0-1 knapsack problems based on amoeboid organism algorithm
zbMATH Open document ID: 1290.90065
author: Xiaoge Zhang
author: Shiyan Huang
author: Yong Hu
author: Yajuan Zhang
author: Sankaran Mahadevan
author: Yong Deng
published in: Applied Mathematics and Computation
publication date: 2014-06-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6305731
zbMATH Keywords: 0-1 knapsack problem
zbMATH Keywords: bio-inspired algorithm
zbMATH Keywords: network converting algorithm
zbMATH Keywords: optimization
zbMATH Keywords: shortest path problem
MaRDI profile type: Publication
full work available at URL: j.amc.2013.04.023
OpenAlex ID: W2090696439
Wikidata QID: Q57853233
cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
cites work: A survey of effective heuristics and their application to a variety of knapsack problems
cites work: An improved typology of cutting and packing problems
cites work: A new ant colony optimization algorithm for the multidimensional Knapsack problem
cites work: Selection among ranked projects under segmentation, policy and logical constraints
cites work: Algorithms for the bounded set-up knapsack problem
cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
cites work: Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
cites work: Solving efficiently the 0-1 multi-objective knapsack problem
cites work: Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
cites work: Exact algorithm for bi-objective 0-1 knapsack problem
cites work: Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
cites work: An exact algorithm for the knapsack sharing problem
cites work: A surface-based DNA algorithm for solving the binary knapsack problem
cites work: A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
cites work: A Modified Binary Particle Swarm Optimization for Knapsack Problems
cites work: The three-dimensional knapsack problem with balancing constraints
cites work: An effective genetic algorithm approach to large scale mixed integer programming problems
cites work: A new hybrid method for solving global optimization problem
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: The particle swarm optimization algorithm: Convergence analysis and parameter selection
cites work: Rules for Biologically Inspired Adaptive Network Design
cites work: A mathematical model for adaptive transport network in path finding by true slime mold
cites work: Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
cites work: A condensation-based application of Cramer's rule for solving large-scale linear systems
DOI: 10.1016/J.AMC.2013.04.023
description: scientific article; zbMATH DE number 6305731