A binary cat swarm optimization algorithm for the non-unicost set covering problem
From MaRDI portal
(Redirected from Publication:1666040)
Recommendations
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- scientific article; zbMATH DE number 1487885
- Binary cockroach swarm optimization for combinatorial optimization problem
- A new approach for solving set covering problem using jumping particle swarm optimization method
- An application of swarm optimization to nonlinear programming
- Catfish bat algorithm-ant colony optimization for subset problems
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
Cites work
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- A hybrid heuristic for the set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A network relaxation based enumeration algorithm for set partitioning
- Algorithms for the set covering problem
- An indirect genetic algorithm for set covering problems
- An Integer Programming Approach to the Vehicle Scheduling Problem
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Enhancing an algorithm for set covering problems
- scientific article; zbMATH DE number 20218 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- Multi-Commodity Disconnecting Sets
- Optimal Political Districting by Implicit Enumeration Techniques
- Set Covering and Involutory Bases
- Simplification of the Covering Problem with Application to Boolean Expressions
- Using a facility location algorithm to solve large set covering problems
- Zero-one programming using non-binary tree-search
Cited in
(5)- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- Catfish bat algorithm-ant colony optimization for subset problems
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- A binary monkey search algorithm variation for solving the set covering problem
- Exploring further advantages in an alternative formulation for the set covering problem
This page was built for publication: A binary cat swarm optimization algorithm for the non-unicost set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666040)
