A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem

DOI10.1016/j.endm.2017.03.004zbMath1388.90103OpenAlexW2605930844MaRDI QIDQ1687628

Olivera Janković, Zorica Stanimirović

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.004

zbMATH Keywords

variable neighborhood search\(p\)-hub covering problembinary coverage

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

The min-p robust optimization approach for facility location problem under uncertainty ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion

Cites Work

• GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
• Scatter search for an uncapacitated \(p\)-hub median problem
• Allocation strategies in hub networks
• Integer programming formulations of discrete hub location problems
• Model formulations for hub covering problems

This page was built for publication: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem