Name
Abstract | ||
|---|---|---|
•Study hub network design problems with profit-oriented objectives.•Simultaneous optimization of collected profit, setup and transportation costs.•A Lagrangian function is used to efficiently obtain bounds at nodes of the tree.•Numerical results confirm the superiority of our framework over commercial solver. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ejor.2017.09.024 | European Journal of Operational Research |
Keywords | Field | DocType |
Location,Hub network design,Hub location,Lagrangian relaxation,Branch-and-bound | Exact solutions in general relativity,Revenue,Branch and bound,Mathematical optimization,Network planning and design,Enumeration,Exploit,Lagrangian relaxation,Mathematics,Operations management,Profit (economics) | Journal |
Volume | Issue | ISSN |
266 | 1 | 0377-2217 |
Citations | PageRank | References |
1 | 0.35 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Armaghan Alibeyg | 1 | 1 | 0.35 |
| Ivan Contreras | 2 | 307 | 17.90 |
| Elena Fernández | 3 | 157 | 10.37 |