Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/17163
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJayaswal, Sachin
dc.contributor.authorVidyarthi, Navneet
dc.contributor.authorDas, Sagnik
dc.date.accessioned2016-01-01T08:00:20Z
dc.date.available2016-01-01T08:00:20Z
dc.date.copyright204
dc.date.issued2014
dc.identifier.urihttp://hdl.handle.net/11718/17163
dc.description.abstractThe Combinatorial bandwidth packing problem (CBPP), arising in a telecommunication network with limited bandwidth, is defined as: given a set of request, each with its potential revenue and consisting of calls with their bandwidth requirements, deciding (i) a subset of the requests to accept/reject, and (ii) a route for each call in an accepted request, so as to maximize total revenue earned. However, telecommunication networks are generally characterized by variability in the call (bits) arrival rates and service times, resulting in delays in the network. In this paper, we present a non-linear integer programming model for CBPP accounting for such delays. By using simple transformation and piecewise outer-approximation, we linearize the model, and present an efficient cutting plane based approach to solve the resulting linear mixed integer program to optimality.en_US
dc.language.isoenen_US
dc.publisherIndian Institute of Management Ahmedabaden_US
dc.relation.ispartofseriesW.P;2014/12/05
dc.subjectOR in Telecommunicationsen_US
dc.subjectBandwidth Packingen_US
dc.subjectMixed Integer Programmingen_US
dc.subjectQueuingen_US
dc.subjectCutting Planeen_US
dc.titleAn efficient solution approach for combinatorial bandwidth packing problem with queuing delaysen_US
dc.typeWorking Paperen_US
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP_2014_12_05.pdfWP_2014_12_05415.75 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.