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

Título:

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

Autor:

Celso da Cruz Carneiro Ribeiro

Ano:

2013

DOI:

10.1016/j.cor.2011.11.018

Revista:

Computers & Operations Research

ISSN:

03050548

Tags:

Lagrangean heuristic

subgradients algorithm

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

A randomized heuristic for scene recognition by graph matching

Experimental analysis of algorithms for updating minimum spanning trees subject to changes on edge weights

A hybrid bin-packing heuristic to multiprocessor scheduling

Modelling Location and Sizing of Offshore Platforms

Tumor growth modelling by cellular automata

Algorithm 797: FORTRAN Subroutines for Approximate Solution of Graph Planarization Problems Using GRASP

An ILS heuristic for the traveling tournament problem with predefined venues

Scheduling workover rigs for onshore oil production

A biased random-key genetic algorithm for single-round divisible load scheduling

Load Balancing in SPMD Applications