Show simple item record

A Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem

dc.contributor.authorHerrmann, Jeffrey W.en_US
dc.contributor.authorIoannou, Georgeen_US
dc.contributor.authorMinis, Ioannisen_US
dc.contributor.authorProth, J.M.en_US
dc.date.accessioned2007-05-23T09:56:29Z
dc.date.available2007-05-23T09:56:29Z
dc.date.issued1994en_US
dc.identifier.urihttp://hdl.handle.net/1903/5508
dc.description.abstractIn this paper we consider the problem of constructing a network over which a number of commodities are to be transported. Fixed costs are associated to the construction of network arcs and variable costs are associated to routing of commodities. In addition, one capacity constraint is related to each arc. The problem is to determine a network design that minimizes the total cost; i.e. it balances the construction and operating costs. A dual ascent procedure for finding improved lower bounds and near- optimal solutions for the fixed-charge capacitated network design problem is proposed. The method is shown to generate tighter lower bounds than the linear programming relaxation of the problem.en_US
dc.format.extent1149134 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1994-29en_US
dc.subjectnetwork programmingen_US
dc.subjectheuristicsen_US
dc.subjectmanufacturingen_US
dc.subjectManufacturing Systemsen_US
dc.titleA Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problemen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record