A variable neighborhood search algorithm for the multimode set covering problem
From MaRDI portal
Publication:887195
DOI10.1007/s10898-013-0094-6zbMath1334.90140OpenAlexW2048871206MaRDI QIDQ887195
Roberto Cordone, Guglielmo Lulli, Fabio Colombo
Publication date: 28 October 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2434/418517
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Multimode extensions of combinatorial optimization problems ⋮ Exploring further advantages in an alternative formulation for the set covering problem
Cites Work
- Unnamed Item
- A GRASP metaheuristic for microarray data analysis
- An effective and simple heuristic for the set covering problem
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
- Variable neighbourhood search: methods and applications
- A mathematical program to refine gene regulatory networks
- A probabilistic heuristic for a computationally difficult set covering problem
- Approximation algorithms for combinatorial problems
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- An algorithm for set covering problem
- An integer optimization approach for reverse engineering of gene regulatory networks
- A 3-flip neighborhood local search for the set covering problem
- An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
- Exact Algorithms for Set Multicover and Multiset Multicover Problems
- A Greedy Heuristic for the Set-Covering Problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Identifying gene regulatory networks from experimental data
This page was built for publication: A variable neighborhood search algorithm for the multimode set covering problem
