A Heuristic Method for the Set Covering Problem

Authors:
Alberto Caprara;Matteo Fischetti;Paolo Toth
Affiliations:
-;-;-
Venue:
Operations Research
Year:
1999

Citing 0
Cited 44

Structural alignment of large—size proteins via lagrangian relaxation

Proceedings of the sixth annual international conference on Computational biology
On some difficult linear programs coming from set partitioning

Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Exploiting Fitness Distance Correlation of Set Covering Problems

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Crew Pairing Optimization with Genetic Algorithms

SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
Models and Algorithms for Integration of Vehicle and Crew Scheduling

Journal of Scheduling
Efficient trip generation with a rule modeling system for crew scheduling problems

Journal of Systems and Software
A SAT Approach to Query Optimization in Mediator Systems

Annals of Mathematics and Artificial Intelligence
On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem

Computers and Industrial Engineering
A GRASP algorithm to solve the unicost set covering problem

Computers and Operations Research
Spectral projected subgradient with a momentum term for the Lagrangean dual approach

Computers and Operations Research
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

INFORMS Journal on Computing
Reinventing Crew Scheduling at Netherlands Railways

Interfaces
Global Optimality Conditions for Discrete and Nonconvex OptimizationWith Applications to Lagrangian Heuristics and Column Generation

Operations Research
A Relax-and-Cut algorithm for the set partitioning problem

Computers and Operations Research
A Heuristic Method for Selecting Support Features from Large Datasets

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Selecting Genotyping Oligo Probes Via Logical Analysis of Data

CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Heuristics for the variable sized bin-packing problem

Computers and Operations Research
The New Dutch Timetable: The OR Revolution

Interfaces
Models and heuristic algorithms for a weighted vertex coloring problem

Journal of Heuristics
Efficient RNAi-based gene family knockdown via set cover optimization

Artificial Intelligence in Medicine
The train driver recovery problem-A set partitioning based model and solution method

Computers and Operations Research
Combined siphon and marking generation for deadlock prevention in Petri nets

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
New ideas for applying ant colony optimization to the set covering problem

Computers and Industrial Engineering
A lagrangian relaxation approach for the multiple sequence alignment problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport

Journal of Heuristics
A Time-Space Network Approach for the Integrated Vehicle-and Crew-Scheduling Problem with Multiple Depots

Transportation Science
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems

INFORMS Journal on Computing
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling

Transportation Science
Survey: matheuristics for rich vehicle routing problems

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Automated personal course scheduling adaptive spreading activation model

ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
An aggregation heuristic for large scale p-median problem

Computers and Operations Research
Lagrangian relaxation applied to sparse global network alignment

PRIB'11 Proceedings of the 6th IAPR international conference on Pattern recognition in bioinformatics
Survey: Covering problems in facility location: A review

Computers and Industrial Engineering
A lagrangian heuristic for winner determination problem in combinatorial auctions

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
A relax-and-cut framework for gomory's mixed-integer cuts

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A computational study of a nonlinear minsum facility location problem

Computers and Operations Research
Computational experience with general cutting planes for the Set Covering problem

Operations Research Letters
An exact approach for the Vertex Coloring Problem

Discrete Optimization
Set covering with almost consecutive ones property

Discrete Optimization
Management of Bus Driver Duties Using Data Mining

International Journal of Applied Metaheuristic Computing
A New Local Search Algorithm for Binary Optimization

INFORMS Journal on Computing
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering

Computers and Operations Research
An iterated-tabu-search heuristic for a variant of the partial set covering problem

Journal of Heuristics
Tactical fixed job scheduling with spread-time constraints

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

British Columbia Gas, a major utility, was required by the British Columbia Utilities Commission (BCUC) to develop an integrated resource plan that addressed multiple objectives and involved the participation of stakeholders. To assist BC Gas, we elicited ...