The hub location problem with market selection
type: Item
instance of: scholarly article
title: The hub location problem with market selection
author: Tao Wu
author: Zhongshun Shi
author: Canrong Zhang
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350531
zbMATH Keywords: hub location
zbMATH Keywords: mixed integer programming
zbMATH Keywords: heuristics
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: profit-maximizing
zbMATH Keywords: Benders decomposition
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105136
OpenAlex ID: W3102439792
cites work: Exact solution of hub network design problems with profits
cites work: Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
cites work: The transfer point location problem
cites work: Integer programming formulations of discrete hub location problems
cites work: Hub Location and the p-Hub Median Problem
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: Exact and heuristic approaches for the cycle hub location problem
cites work: Uncapacitated single and multiple allocation \(p\)-hub center problems
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Adapting polyhedral properties from facility to hub location problems
cites work: Design of intermodal logistics networks with hub delays
cites work: Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
cites work: Q4821303
cites work: The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
cites work: A competitive hub location and pricing problem
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Hub location under competition
cites work: Location of hubs in a competitive environment
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: A Stackelberg hub arc location model for a competitive environment
cites work: STACKELBERG HUB LOCATION PROBLEM
cites work: A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
cites work: A hub covering model for cargo delivery systems
cites work: Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
DOI: 10.1016/J.COR.2020.105136
description: scientific article; zbMATH DE number 7350531