Sensitivity Analysis of ACO Start Strategies for Subset Problems

DOI10.1007/978-3-642-18466-6_30zbMath1279.90201OpenAlexW1539401841MaRDI QIDQ3075276

No author found.

Publication date: 11 February 2011

Published in: Numerical Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18466-6_30

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• New directions in cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sensitivity Analysis of ACO Start Strategies for Subset Problems