A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering : GRASP with path relinking

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 40; no. 12; pp. 3132 - 3146
Main Authors PESSOA, Luciana S, RESENDE, Mauricio G. C, RIBEIRO, Celso C
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier 2013
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Biological and medical sciences
Computer science; control theory; systems
Exact sciences and technology
Flows in networks. Combinatorial problems
Fundamental and applied biological sciences. Psychology
General aspects
Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects)
Operational research and scientific management
Operational research. Management science
Theoretical computing
Costs
Covering problem
Stabilization
Metaheuristics
Evolutionary algorithm
Randomized algorithm
Combinatorial optimization
Lagrange multiplier
Model matching
Set covering
Bioinformatics
Metamodel
GRASP
Hybrid heuristics
Lower bound
Local search
Subgradient optimization
Lagrangean relaxation
Routing
Coverage
Distributed system
Communication network
Path-relinking
Lagrangean heuristics
Size specification
Optimal solution
Heuristic method
Greedy algorithm
Set k-covering
Set multicovering
Online AccessGet full text

Cover

More Information
ISSN:0305-0548
1873-765X