Solving 0-1 knapsack problems based on amoeboid organism algorithm
DOI10.1016/J.AMC.2013.04.023zbMATH Open1290.90065OpenAlexW2090696439WikidataQ57853233 ScholiaQ57853233MaRDI QIDQ2016352FDOQ2016352
Authors: Xiaoge Zhang, Shiyan Huang, Yong Hu, Yajuan Zhang, Sankaran Mahadevan, Yong Deng 
Publication date: 20 June 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.04.023
Recommendations
optimizationshortest path problem0-1 knapsack problembio-inspired algorithmnetwork converting algorithm
Cites Work
- An improved typology of cutting and packing problems
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Selection among ranked projects under segmentation, policy and logical constraints
- A survey of effective heuristics and their application to a variety of knapsack problems
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- A mathematical model for adaptive transport network in path finding by true slime mold
- Rules for biologically inspired adaptive network design
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- An exact algorithm for the knapsack sharing problem
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- Exact algorithm for bi-objective 0-1 knapsack problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- A genetic algorithm for the multidimensional knapsack problem
- Algorithms for the bounded set-up knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- The three-dimensional knapsack problem with balancing constraints
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- A condensation-based application of Cramer's rule for solving large-scale linear systems
- A new hybrid method for solving global optimization problem
- An effective genetic algorithm approach to large scale mixed integer programming problems
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- A surface-based DNA algorithm for solving the binary knapsack problem
Cited In (13)
- Title not available (Why is that?)
- A parallel bio-inspired shortest path algorithm
- Pilot-wave quantum theory with a single Bohm's trajectory
- A bio-inspired algorithm for identification of critical components in the transportation networks
- A biologically inspired optimization algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths
- Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy
- An amoeboid algorithm for solving linear transportation problem
- \textit{Physarum} solver: a bio-inspired method for sustainable supply chain network design problem
- Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem
- A new multi-agent system to simulate the foraging behaviors of \textit{Physarum}
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- An evidential opinion dynamics model based on heterogeneous social influential power
- An ant colony optimization approach for binary knapsack problem under fuzziness
This page was built for publication: Solving 0-1 knapsack problems based on amoeboid organism algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016352)
