An efficient local search heuristic with row weighting for the unicost set covering problem

DOI10.1016/j.ejor.2015.05.038zbMath1346.90702OpenAlexW1917814591MaRDI QIDQ319859

Jinlong Li, Thomas Weise, Chao Gao, Xin Yao

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.038

zbMATH Keywords

combinatorial optimizationrow weighting local searchunicost set covering problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets ⋮ A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem ⋮ MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ Proof of covering minimality by generalizing the notion of independence ⋮ A set-cover-based approach for the test-cost-sensitive attribute reduction problem ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Solving the wire-harness design problem at a European car manufacturer

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A biased random-key genetic algorithm for the Steiner triple covering problem
• An effective and simple heuristic for the set covering problem
• A GRASP algorithm to solve the unicost set covering problem
• An electromagnetism metaheuristic for the unicost set covering problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Enhancing an algorithm for set covering problems
• A genetic algorithm for the set covering problem
• Computational experience with approximation algorithms for the set covering problem
• A Lagrangian-based heuristic for large-scale set covering problems
• Algorithms for railway crew management
• An algorithm for set covering problem
• Solving large Steiner Triple Covering Problems
• A 3-flip neighborhood local search for the set covering problem
• The set covering problem revisited: an empirical study of the value of dual information
• An efficient heuristic for large set covering problems
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Greedy Heuristic for the Set-Covering Problem
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• Note: A local-search heuristic for large set-covering problems
• A Heuristic Method for the Set Covering Problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Algorithms for the set covering problem

This page was built for publication: An efficient local search heuristic with row weighting for the unicost set covering problem