Show simple item record

dc.contributor.authorHutauruk, Sindak
dc.contributor.authorSimanjuntak, Jamser
dc.contributor.authorSirait, Binsar
dc.date.accessioned2018-03-19T02:20:35Z
dc.date.available2018-03-19T02:20:35Z
dc.date.issued1998-04-12
dc.identifier.urihttp://repository.uhn.ac.id/handle/123456789/577
dc.description.abstractThe goal of optimal network design and facility engineering is to arrive at network topologies that minimize total network cost while selecting fucility types. allocating capacity. and routing traffic to accommodate demand and performance requirements. This research describes a data network design model based on a Mixed Integer/Linear Programming (M1LP) formulation. as do most other approaches. separate link capacity and facility selection from routing and topological design. it fully integrates these processes to capture the VCIY important couplings that exist between them. We show that our formulation leads to a natural decomposition of the optunal design problem into two subproblems solvable sequencially. We present a linki reduction algnrithm that efficiently design single or multifacility networks. This algorithm is based on a special-purpose monotonic greedy drop heuristic procedure.en_US
dc.publisherFakultas Teknik Universitas HKBP Nommensenen_US
dc.subjectJaringanen_US
dc.subjectAlgoritmaen_US
dc.subjectLinken_US
dc.titleJoint Optimization of Data Network Design and Facility Selection by Using Linear Programmingen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record