A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
type: Item
instance of: scholarly article
title: A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
zbMATH Open document ID: 1375.90173
author: Marcos Roberto Silva
author: Claudio B. Cunha
published in: European Journal of Operational Research
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6816194
zbMATH Keywords: location
zbMATH Keywords: hub-and-spoke network
zbMATH Keywords: hub covering problem
zbMATH Keywords: tabu search
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.03.066
OpenAlex ID: W2599976886
cites work: A hybrid heuristic for the uncapacitated hub location problem
cites work: Network hub location problems: The state of the art
cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks
cites work: Integer programming formulations of discrete hub location problems
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A hub covering network design problem for cargo applications in Turkey
cites work: The single-assignment hub covering problem: Models and linearizations
cites work: Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
cites work: Exact and heuristic algorithms for the design of hub networks with multiple lines
cites work: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: A branch-and-cut algorithm for the hub location and routing problem
cites work: Unmanned aerial vehicle hub-location and routing for monitoring geographic borders
cites work: New simple and efficient heuristics for the uncapacitated single allocation hub location problem
cites work: On tabu search for the location of interacting hub facilities
DOI: 10.1016/J.EJOR.2017.03.066
description: scientific article; zbMATH DE number 6816194