Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
type: Item
instance of: scholarly article
title: Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
zbMATH Open document ID: 1380.90236
author: Olivera Janković
author: Stefan Mišković
author: Zorica Stanimirović
author: Raca Todosijević
published in: Annals of Operations Research
publication date: 2018-02-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6839487
zbMATH Keywords: \(p\)-hub maximal covering problem
zbMATH Keywords: binary and partial coverage
zbMATH Keywords: mixed integer programming
zbMATH Keywords: variable neighborhood search
MaRDI profile type: Publication
full work available at URL: s10479-017-2508-1
OpenAlex ID: W2612915199
cites work: Q3056948
cites work: Network hub location problems: The state of the art
cites work: A hub covering network design problem for cargo applications in Turkey
cites work: Obtaining test problems via Internet
cites work: The generalized maximal covering location problem
cites work: The gradual covering decay location problem on a network.
cites work: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
cites work: Integer programming formulations of discrete hub location problems
cites work: Variable neighborhood search for minimum sum-of-squares clustering on networks
cites work: A variable neighborhood search based matheuristic for nurse rostering problems
cites work: New heuristic algorithms for solving the planar \(p\)-median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: A Lagrangean heuristic for the maximal covering location problem
cites work: Variable neighbourhood search: methods and applications
cites work: Variable neighborhood search: basics and variants
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: The single-assignment hub covering problem: Models and linearizations
cites work: A maximal covering location model in the presence of partial coverage
cites work: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
cites work: A two phase variable neighborhood search for the multi-product inventory routing problem
cites work: Variable neighborhood search
cites work: Two level general variable neighborhood search for attractive traveling salesman problem
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Variable neighborhood search for the stochastic and dynamic vehicle routing problem
cites work: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
cites work: Model formulations for hub covering problems
cites work: Allocation strategies in hub networks
DOI: 10.1007/S10479-017-2508-1
description: scientific article; zbMATH DE number 6839487