Exploring Further Advantages in an Alternative Formulation for the Set Covering Problem
The set covering problem (SCP) is an NP-complete optimization problem, fitting with many problems in engineering. The traditional SCP formulation does not directly address both solution unsatisfiability and set redundancy aspects. As a result, the solving methods have to control these aspects to avo...
Main Authors: | Jose M. Lanza-Gutierrez, N. C. Caballe, Broderick Crawford, Ricardo Soto, Juan A. Gomez-Pulido, Fernando Paredes |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2020/5473501 |
Similar Items
-
Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
by: Broderick Crawford, et al.
Published: (2014-01-01) -
Toward a Robust Multi-Objective Metaheuristic for Solving the Relay Node Placement Problem in Wireless Sensor Networks
by: José M. Lanza-Gutiérrez, et al.
Published: (2019-02-01) -
Adaptive Black Hole Algorithm for Solving the Set Covering Problem
by: Ricardo Soto, et al.
Published: (2018-01-01) -
A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem
by: Broderick Crawford, et al.
Published: (2015-01-01) -
A Meta-Optimization Approach to Solve the Set Covering Problem
by: Gino Astorga, et al.
Published: (2018-11-01)