A binary cat swarm optimization algorithm for the non-unicost set covering problem
DOI10.1155/2015/578541zbMATH Open1394.90430OpenAlexW1548305550WikidataQ59119440 ScholiaQ59119440MaRDI QIDQ1666040FDOQ1666040
Authors: Broderick Crawford, Ricardo L. Soto, Natalia Berríos, Franklin Johnson, Fernando Paredes, C. Castro, Enrique Norero 
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/578541
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
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for the set covering problem
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- Enhancing an algorithm for set covering problems
- A Lagrangian-based heuristic for large-scale set covering problems
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Title not available (Why is that?)
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- An indirect genetic algorithm for set covering problems
- Optimal Political Districting by Implicit Enumeration Techniques
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A hybrid heuristic for the set covering problem
- Simplification of the Covering Problem with Application to Boolean Expressions
- Multi-Commodity Disconnecting Sets
- Using a facility location algorithm to solve large set covering problems
- A network relaxation based enumeration algorithm for set partitioning
- Zero-one programming using non-binary tree-search
- Set Covering and Involutory Bases
Cited In (4)
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- Exploring further advantages in an alternative formulation for the set covering problem
- A binary monkey search algorithm variation for solving the set covering problem
Uses Software
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)
