An efficient procedure for designing single allocation hub and spoke systems
Management Science
Discrete Mathematics
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming: Series A and B
Using Extra Dual Cuts to Accelerate Column Generation
INFORMS Journal on Computing
Hub-and-spoke network design with congestion
Computers and Operations Research
Selected Topics in Column Generation
Operations Research
Dual-Optimal Inequalities for Stabilized Column Generation
Operations Research
Comparison of bundle and classical column generation
Mathematical Programming: Series A and B
Capacitated single allocation hub location problem-A bi-criteria approach
Computers and Operations Research
On the choice of explicit stabilizing terms in column generation
Discrete Applied Mathematics
Formulating and solving splittable capacitated multiple allocation hub location problems
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Tight bounds from a path based formulation for the tree of hub location problem
Computers and Operations Research
Single allocation hub location problem under congestion: Network owner and user perspectives
Expert Systems with Applications: An International Journal
Benders Decomposition for Large-Scale Uncapacitated Hub Location
Operations Research
Twenty-Five Years of Hub Location Research
Transportation Science
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels
Transportation Science
Computers and Industrial Engineering
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
Journal of Scheduling
A Stackelberg hub arc location model for a competitive environment
Computers and Operations Research
| Hi-index | 0.00 |
This paper presents a branch-and-price algorithm for the capacitated hub location problem with single assignment, in which Lagrangean relaxation is used to obtain tight lower bounds of the restricted master problem. A lower bound that is valid at any stage of the column generation algorithm is proposed. The process to obtain this valid lower bound is combined with a constrained stabilization method that results in a considerable improvement on the overall efficiency of the solution algorithm. Numerical results on a battery of benchmark instances of up to 200 nodes are reported. These seem to be the largest instances that have been solved to optimality for this problem.