Lagrangean decomposition for the multicommodity capacitated network design problem
Lagrangean decomposition for the multicommodity capacitated network design problem
Traditional Lagrangean relaxations for the multicommodity capacitated network design problem (MCNDP) involve dualizing either arc capacity or flow conservation constraints. The former (shortest-path relaxation) results in loosing the capacity structure whereas the latter (knapsack relaxation) does not maintain any information related to the network structure. In this talk, we discuss a new relaxation for the MCNDP, based on Lagrangean decomposition, which allows one to decompose the problem by nodes, and the subproblems partially preserve both the network and the capacity structure.
Bektas, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Crainic, Teodor Gabriel
a0023c61-7f94-4424-af61-70a58f478455
Gendron, Bernard
005abd8f-5fef-4e59-a898-1c18e947fa91
7 May 2007
Bektas, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Crainic, Teodor Gabriel
a0023c61-7f94-4424-af61-70a58f478455
Gendron, Bernard
005abd8f-5fef-4e59-a898-1c18e947fa91
Bektas, Tolga, Crainic, Teodor Gabriel and Gendron, Bernard
(2007)
Lagrangean decomposition for the multicommodity capacitated network design problem.
Optimization Days 2007, Montreal, Canada.
06 - 08 May 2007.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Traditional Lagrangean relaxations for the multicommodity capacitated network design problem (MCNDP) involve dualizing either arc capacity or flow conservation constraints. The former (shortest-path relaxation) results in loosing the capacity structure whereas the latter (knapsack relaxation) does not maintain any information related to the network structure. In this talk, we discuss a new relaxation for the MCNDP, based on Lagrangean decomposition, which allows one to decompose the problem by nodes, and the subproblems partially preserve both the network and the capacity structure.
This record has no associated files available for download.
More information
Published date: 7 May 2007
Venue - Dates:
Optimization Days 2007, Montreal, Canada, 2007-05-06 - 2007-05-08
Identifiers
Local EPrints ID: 55826
URI: http://eprints.soton.ac.uk/id/eprint/55826
PURE UUID: 6c3852f2-4e9f-4260-8f0b-cead19930710
Catalogue record
Date deposited: 08 May 2009
Last modified: 11 Dec 2021 17:46
Export record
Contributors
Author:
Tolga Bektas
Author:
Teodor Gabriel Crainic
Author:
Bernard Gendron
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics