The University of Southampton
University of Southampton Institutional Repository

Lagrangean decomposition for the multicommodity capacitated network design problem

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
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. 07 - 09 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.

Full text not available from this repository.

More information

Published date: 7 May 2007
Venue - Dates: Optimization Days 2007, 2007-05-07 - 2007-05-09

Identifiers

Local EPrints ID: 55826
URI: https://eprints.soton.ac.uk/id/eprint/55826
PURE UUID: 6c3852f2-4e9f-4260-8f0b-cead19930710
ORCID for Tolga Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 08 May 2009
Last modified: 14 Mar 2019 01:39

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×