Exact methods for the discrete multiple allocation (r|p) hub-centroid problem

DOI10.1016/J.COR.2019.104870MaRDI QIDQ2289952zbMATH OpenOpenAlexFDO

Authors Antonio Camargo Andrade de Araújo, Marcos Costa Roboredo, Artur Alves Pessoa, Valdecy Pereira

Publication date 27 January 2020

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2019.104870

zbMATH Keywords

branch-and-cutcompetitive locationhub location

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• An exact method for the discrete \((r|p)\)-centroid problem
• Hub location under competition
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• The \(p\)-hub center allocation problem

Cites work

• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• A competitive hub location and pricing problem
• A conditional p-hub location problem with attraction functions
• A hub covering model for cargo delivery systems
• A Leader-Follower Hub Location Problem Under Fixed Markups
• A note on ``Location of hubs in a competitive environment
• A Stackelberg hub arc location model for a competitive environment
• An exact approach for the \(r\)-interdiction covering problem with fortification
• An exact approach for the r-interdiction median problem with fortification
• An exact method for the discrete \((r|p)\)-centroid problem
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
• Hub location under competition
• Hub location-allocation in intermodal logistic networks
• HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
• Integer programming formulations for three sequential discrete competitive location problems with foresight
• Location of hubs in a competitive environment
• Multiple voting location and single voting location on trees
• Network hub location problems: The state of the art
• On locating new facilities in a competitive environment
• STACKELBERG HUB LOCATION PROBLEM
• The competitive hub location under the price war

Cited in

(9)

• Perspectives on modeling hub location problems
• Competitive multiple allocation hub location problem considering primary and backup routes
• A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• On the \(p\)-hub interdiction problem
• Planning and design of intermodal hub networks: a literature review
• A leader-follower single allocation hub location problem under fixed markups
• The \(p\)-hub center allocation problem
• An exact method for the discrete \((r|p)\)-centroid problem

This page was built for publication: Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289952)