Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem

DOI10.1007/978-3-540-78827-0_62zbMath1229.90160OpenAlexW1563004016MaRDI QIDQ3616856

Stefka Fidanova

Publication date: 26 March 2009

Published in: Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78827-0_62

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Stochastic on-line knapsack problems
• Ant colonies for the quadratic assignment problem
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• New directions in cryptography
• Solving Multiple Knapsack Problems by Cutting Planes