Online citations, reference lists, and bibliographies.
← Back to Search

A Probabilistic Heuristic For A Computationally Difficult Set Covering Problem

T. Feo, M. Resende
Published 1989 · Mathematics

Save to my Library
Download PDF
Analyze on Scholarcy Visualize in Litmaps
Share
Reduce the time it takes to create your bibliography by a factor of 10 by using the world’s favourite reference manager
Time to take this seriously.
Get Citationsy
An efficient probabilistic set covering heuristic is presented. The heuristic is evaluated on empirically difficult to solve set covering problems that arise from Steiner triple systems. The optimal solution to only a few of these instances is known. The heuristic provides these solutions as well as the best known solutions to all other instances attempted.
This paper references



This paper is referenced by
10.1007/S12597-020-00503-3
Metaheuristics for the distance constrained generalized covering traveling salesman problem
Prashant Singh (2021)
10.3390/LOGISTICS5020039
An Extended Model for Disaster Relief Operations Used on the Hagibis Typhoon Case in Japan
Darya Hrydziushka (2021)
10.1287/IJOC.2020.0966
A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
A. D. López-Sánchez (2021)
10.5267/J.IJIEC.2020.11.003
A specialized genetic algorithm for the fuel consumption heterogeneous fleet vehicle routing problem with bidimensional packing constraints
Luis Miguel Escobar-Falcón (2021)
10.1287/IJOO.2019.0044
Orbital Conflict: Cutting Planes for Symmetric Integer Programs
Jeff T. Linderoth (2021)
10.1016/J.ESWA.2021.115184
An improved GRASP method for the multiple row equal facility layout problem
Nicolás R. Uribe (2021)
10.1007/S12351-019-00495-Z
Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation
A. Anokic (2021)
10.1007/978-3-030-70277-9_3
Single Solution Metaheuristics
V. Maniezzo (2021)
10.1016/J.EJOR.2021.02.015
An improved configuration checking-based algorithm for the unicost set covering problem
Yiyuan Wang (2021)
10.3390/MATH9050509
An Efficient Algorithm for Crowd Logistics Optimization
Raúl Martín-Santamaría  (2021)
10.1016/j.cie.2020.106962
Customer order scheduling problem to minimize makespan with sequence-dependent setup times
B. Prata (2021)
10.1016/j.cie.2020.106964
A computational study of a decomposition approach for the dynamic two-level uncapacitated facility location problem with single and multiple allocation
Paganini Barcellos de Oliveira (2021)
A Two-step Heuristic for the Periodic Demand Estimation Problem
G. Laage (2021)
10.1007/S12065-020-00543-0
QoS based deliver model of the packages transportation by the passenger train and solution algorithm
Juhua Yang (2021)
10.1002/net.22010
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
F. Carrabs (2021)
10.1016/j.asoc.2021.107151
A GRASP-based algorithm for solving the emergency room physician scheduling problem
M. Cildoz (2021)
10.3390/A14040115
Dynamic Initial Weight Assignment for MaxSAT
Abdelraouf Ishtaiwi (2021)
10.1186/s40537-021-00433-x
Multi-objective database queries in combined knapsack and set covering problem domains
Sean A. Mochocki (2021)
10.1007/s10462-021-10026-y
A comprehensive survey of sine cosine algorithm: variants and applications
Asma Benmessaoud Gabis (2021)
10.1007/978-3-030-64541-0_2
Controller Tuning by Metaheuristics Optimization
M. Blondin (2021)
10.3390/ELECTRONICS10111232
Multi-Objective GRASP for Maximizing Diversity
Pedro Casas-Martínez (2021)
10.1016/J.EJOR.2021.04.020
Finding efficient make-to-order production and batch delivery schedules
David Bachtenkirch (2021)
10.1287/TRSC.2020.1034
Intraroute Resource Replenishment with Mobile Depots
Julian Hof (2021)
10.1016/j.cpc.2020.107587
Spectral analysis and optimization of the condition number problem
H. Cardoso (2021)
10.1109/ACCESS.2021.3067597
Grasshopper Optimization Algorithm: Theory, Variants, and Applications
Yassine Meraihi (2021)
10.4018/978-1-7998-5886-7.ch011
Managing Transportation in Supply Chain
F. S. Madenoğlu (2021)
10.1007/S12351-019-00463-7
An iterative algorithm for the Max-Min knapsack problem with multiple scenarios
Thekra Al Douri (2021)
10.21203/rs.3.rs-122216/v1
Multi-Objective Database Queries in Combined Knapsack and Set Covering Problem Domains
Sean A. Mochocki (2020)
10.1007/978-3-030-41913-4
Optimization and Learning: Third International Conference, OLA 2020, Cádiz, Spain, February 17–19, 2020, Proceedings
Phoebe Chen (2020)
10.1007/978-3-030-58861-8_9
Meta-learning to Select the Best Metaheuristic for the MaxSAT Problem
Souhila Sadeg (2020)
10.1111/exsy.12540
Finding weaknesses in networks using Greedy Randomized Adaptive Search Procedure and Path Relinking
Sergio Pérez-Peló (2020)
10.3390/rs12142285
Survey of 8 UAV Set-Covering Algorithms for Terrain Photogrammetry
Joshua Hammond (2020)
See more
Semantic Scholar Logo Some data provided by SemanticScholar