Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints


Bektas, T., Chouman, M. and Crainic, T.G. (2010) Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints. Networks, 55, (3), 171-180. (doi:10.1002/net.20362).

Download

Full text not available from this repository.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1002/net.20362
Related URLs:
Subjects: H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions : University Structure - Pre August 2011 > School of Management
ePrint ID: 55113
Accepted Date and Publication Date:
Status
2010Published
Date Deposited: 05 Aug 2008
Last Modified: 31 Mar 2016 12:34
URI: http://eprints.soton.ac.uk/id/eprint/55113

Actions (login required)

View Item View Item