You are here
Lagrangian relaxation for the time-dependent combined network design and routing problem
| Title | Lagrangian relaxation for the time-dependent combined network design and routing problem |
| Publication Type | Conference Paper |
| Year of Publication | 2015 |
| Authors | Papadimitriou, D., B. Fortz, and E. Gorgone |
| Conference Name | Communications (ICC), 2015 IEEE International Conference on |
| Date Published | June |
| Publisher | IEEE XPlore |
| Conference Location | London, United-Kingdom |
| Keywords | allocation planning process, flow conservation constraints, integer programming, integer programming methods, Lagrangian relaxation, linear programming, Maintenance engineering, multi-commodity capacitated fixed charge network design, network routing problem, Optimization, Quality of Service, Reliability, resource allocation, resource installation, Resource management, Routing, routing decision process, telecommunication network routing, telecommunication traffic, time-dependent combined network design, traffic demands |
| DOI | 10.1109/ICC.2015.7249283 |
| Citation Key | 7249283 |
Project year:
Third year
WP(s) associated with the paper:
WP4 - mPlane Supervisor: Iterative and Adaptive Analysis
Partner(s) associated with the paper's author(s):
Alcatel-Lucent Bell Nv
Is this an OFFICIALLY supported mPlane paper?:
Yes
 |
The information available on this website is property of the contributing authors from the mPlane Consortium (project FP7-ICT-318627) and does not necessarily reflect the view of the European Commission. The information in this website is provided "as is", and no guarantee or warranty is given that the information is fit for any particular purpose. The user uses the information at its sole risk and liability. |
 |
News RSS