Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem

DOI10.1007/s10589-013-9629-5zbMath1302.90237OpenAlexW2082452219MaRDI QIDQ742303

Edward Hult, Daniel Ralph, Houyuan Jiang

Publication date: 18 September 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-013-9629-5

zbMATH Keywords

stochastic programmingcenter problemvariable reductionhub locationseparation algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Related Items (1)

A bi-objective incomplete hub location-routing problem with flow shipment scheduling

Cites Work

• Unnamed Item
• Stochastic uncapacitated hub location
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• Stochastic air freight hub location and flight routes planning
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
• The stochastic \(p\)-hub center problem with service-level constraints
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Location models for airline hubs behaving as \(M/D/c\) queues.
• On the single-assignment \(p\)-hub center problem
• Network hub location problems: The state of the art
• A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
• Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
• Service-Level Differentiation in Call Centers with Fully Flexible Servers
• The β-Reliable Median on a Network with Discrete Probabilistic Demand Weights
• Efficient algorithms for the uncapacitated single allocation p-hub median problem

This page was built for publication: Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem