A binary cat swarm optimization algorithm for the non-unicost set covering problem

DOI10.1155/2015/578541zbMath1394.90430OpenAlexW1548305550WikidataQ59119440 ScholiaQ59119440MaRDI QIDQ1666040

Broderick Crawford, Ricardo L. Soto, Franklin Johnson, Natalia Berríos, Enrique Norero, Carlos Castro, Fernando Paredes

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

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A binary monkey search algorithm variation for solving the set covering problem, 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

Uses Software

• OR-Library
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid heuristic for the set covering problem
• Using a facility location algorithm to solve large set covering problems
• A network relaxation based enumeration algorithm for set partitioning
• Enhancing an algorithm for set covering problems
• A Lagrangian-based heuristic for large-scale set covering problems
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• An Integer Programming Approach to the Vehicle Scheduling Problem
• An indirect genetic algorithm for set covering problems
• Multi-Commodity Disconnecting Sets
• Optimal Political Districting by Implicit Enumeration Techniques
• Simplification of the Covering Problem with Application to Boolean Expressions
• Zero-one programming using non-binary tree-search
• Set Covering and Involutory Bases
• Algorithms for the set covering problem