Multiple allocation hub-and-spoke network design under hub congestion
type: Item
instance of: scholarly article
title: Multiple allocation hub-and-spoke network design under hub congestion
zbMATH Open document ID: 1177.90064
author: G. jun. Miranda
author: Ricardo S. de Camargo
author: Ricardo P. M. Ferreira
author: Henrique Pacca Loureiro Luna
published in: Computers \& Operations Research
publication date: 2009-08-14T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5595282
zbMATH Keywords: hub-and-spoke networks
zbMATH Keywords: Benders decomposition
zbMATH Keywords: large scale optimization
zbMATH Keywords: mixed integer nonlinear programming
MaRDI profile type: Publication
full work available at URL: j.cor.2008.10.004
OpenAlex ID: W2165412882
cites work: Location and allocation for distribution systems with transshipments and transportion economies of scale
cites work: Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
cites work: Q3147668
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Integer programming formulations of discrete hub location problems
cites work: Network hub location problems: The state of the art
cites work: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
cites work: Solution algorithms for the capacitated single allocation hub location problem
cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms
cites work: Hub Arc Location Problems: Part I—Introduction and Results
cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
cites work: Solving the hub location problem with modular link capacities
cites work: A branch and cut algorithm for hub location problems with single assignment
cites work: Heuristic concentration: Two stage solution construction
cites work: Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
cites work: Formulating and solving splittable capacitated multiple allocation hub location problems
cites work: The Latest Arrival Hub Location Problem
cites work: Location models for airline hubs behaving as \(M/D/c\) queues.
cites work: Capacitated single allocation hub location problem-A bi-criteria approach
cites work: Solving a capacitated hub location problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Benders-and-cut algorithm for fixed-charge capacitated network design problem
cites work: Hub-and-spoke network design with congestion
cites work: Adapting polyhedral properties from facility to hub location problems
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: Hub network design with single and multiple allocation: A computational study
cites work: Generalized Benders decomposition
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Benders decomposition for the uncapacitated multiple allocation hub location problem
cites work: New formulations for the uncapacitated multiple allocation hub location problem
cites work: A new proximal decomposition algorithm for routing in telecommunication networks
cites work: Multicommodity network expansion under elastic demands
cites work: Tailoring Benders decomposition for uncapacitated network design
cites work: A Benders decomposition approach for the locomotive and car assignment problem
cites work: Simultaneous Assignment of Locomotives and Cars to Passenger Trains
cites work: Optimal solution of cellular manufacturing system design: Bender's decomposition approach
cites work: A comparison of optimal methods for local access uncapacitated network design
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
cites work: Bender's method revisited
cites work: Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
cites work: Q5630824
cites work: The flow deviation method: An approach to store‐and‐forward communication network design
cites work: Optimal Routing in a Packet-Switched Computer Network
cites work: Preprocessing and cutting for multiple allocation hub location problems.
cites work: A hub covering model for cargo delivery systems
DOI: 10.1016/J.COR.2008.10.004
Recommended article: Hub-and-spoke network design with congestion
Recommended article: Hub network design with single and multiple allocation: A computational study
Recommended article: Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
Recommended article: Allocation strategies in hub networks
Recommended article: A cost allocation problem arising in hub-spoke network systems
Recommended article: Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks
Recommended article: A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
Recommended article: Incremental optimization of hub and spoke network for the spokes' numbers and flow
Recommended article: Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
Recommended article: Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion