A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
type: Item
instance of: scholarly article
title: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
zbMATH Open document ID: 1388.90103
author: Olivera Janković
author: Zorica Stanimirović
publication date: 2018-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6821792
zbMATH Keywords: \(p\)-hub covering problem
zbMATH Keywords: binary coverage
zbMATH Keywords: variable neighborhood search
MaRDI profile type: Publication
full work available at URL: j.endm.2017.03.004
OpenAlex ID: W2605930844
cites work: Integer programming formulations of discrete hub location problems
cites work: Scatter search for an uncapacitated \(p\)-hub median problem
cites work: GRASP for 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.1016/J.ENDM.2017.03.004
description: scientific article; zbMATH DE number 6821792