The Multiperiod Network Design Problem: Lagrangian-based Solution Approaches

Please always quote using this URN: urn:nbn:de:0297-zib-13367
  • We present and prove a theorem which gives the optimal dual vector for which a Lagrangian dual problem in the Single Period Design Problem (SPDP) is maximized. Furthermore we give a straightforward generalization to the Multi-Period Design Problem (MPDP). Based on the optimal dual values derived we compute the solution of the Lagrangian relaxation and compare it with the linear relaxation and optimal IP values.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Anastasios Giovanidis, Jonad Pulaj
Document Type:ZIB-Report
Date of first Publication:2011/07/13
Series (Serial Number):ZIB-Report (11-31)