Name
Title | ||
|---|---|---|
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1287/ijoc.1100.0391 | INFORMS Journal on Computing |
Keywords | Field | DocType |
hub location,lagrangean relaxation,column generation. | Single assignment,Column generation,Mathematical optimization,Upper and lower bounds,Branch and price,Hub location problem,Mathematics | Journal |
Volume | Issue | ISSN |
23 | 1 | 1091-9856 |
Citations | PageRank | References |
17 | 0.82 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Contreras | 1 | 307 | 17.90 |
| Juan A. Díaz | 2 | 178 | 14.00 |
| Elena Fernández | 3 | 157 | 10.37 |