Experiments with LAGRASP heuristic for set \(k\)-covering
type: Item
instance of: scholarly article
title: Experiments with LAGRASP heuristic for set \(k\)-covering
zbMATH Open document ID: 1259.90113
author: Luciana S. Pessoa
author: Mauricio G. C. Resende
author: Celso C. Ribeiro
published in: Optimization Letters
publication date: 2012-11-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6111699
zbMATH Keywords: GRASP
zbMATH Keywords: hybrid heuristics
zbMATH Keywords: metaheuristics
zbMATH Keywords: path-relinking
zbMATH Keywords: Lagrangean relaxation
zbMATH Keywords: Lagrangean heuristics
zbMATH Keywords: local search
zbMATH Keywords: set covering
zbMATH Keywords: set multicovering
zbMATH Keywords: set \(k\)-covering
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: s11590-011-0312-4
OpenAlex ID: W1968709147
cites work: Quantum mechanical algorithms for the nonabelian hidden subgroup problem
cites work: The multicovering problem
cites work: Computational experience with general cutting planes for the set covering problem
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
cites work: Greedy randomized adaptive search procedures
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: An algorithm for set covering problem
cites work: Q4735035
cites work: Validation of subgradient optimization
DOI: 10.1007/S11590-011-0312-4
description: scientific article; zbMATH DE number 6111699