RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
From MaRDI portal
Publication:5385039
DOI10.15807/JORSJ.50.350zbMath1142.90479OpenAlexW2155985395MaRDI QIDQ5385039
Shunji Umetani, Mutsunori Yagiura
Publication date: 29 April 2008
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.50.350
linear programmingLagrangian relaxationcombinatorial optimizationsubgradient methodset covering problemheuristic algorithm
Related Items (14)
An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ Relaxation heuristics for the set multicover problem with generalized upper bound constraints ⋮ The robust set covering problem with interval data ⋮ A hybrid heuristic for the set covering problem ⋮ Optimizing word set coverage for multi-event summarization ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ A Nested Decomposition Approach for a Large Scale Set Covering Problem: A Model with a Variety of Applications in Industry 4.0 ⋮ A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem ⋮ An electromagnetism metaheuristic for the unicost set covering problem ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains ⋮ A set covering based matheuristic for a real‐world city logistics problem ⋮ Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set ⋮ A set covering approach for multi-depot train driver scheduling
Uses Software
This page was built for publication: RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
