A hybrid soft computing approach for subset problems
From MaRDI portal
(Redirected from Publication:474017)
Recommendations
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
- Application of ant colony optimization metaheuristic on set covering problems
- Sensitivity analysis of ACO start strategies for subset problems
- scientific article; zbMATH DE number 1594538
- Start Strategies of ACO Applied on Subset Problems
Cites work
- A Set Partitioning Approach to the Crew Scheduling Problem
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Backjump-based backtracking for constraint satisfaction problems
- Consistency in networks of relations
- Constraint handling in genetic algorithms: the set partitioning problem
- On some difficult linear programs coming from set partitioning
- Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
Cited in
(4)- Catfish bat algorithm-ant colony optimization for subset problems
- The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
- A depth-based heuristic to solve the multi-objective influence spread problem using particle swarm optimization
- A bicriteria approach identifying nondominated portfolios
This page was built for publication: A hybrid soft computing approach for subset problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474017)
