Please use this identifier to cite or link to this item:
https://repository.iimb.ac.in/handle/123456789/5539
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Murthy, Ishwar | - |
dc.contributor.author | Ramtek, Anand Kumar | en_US |
dc.contributor.author | Raghavendra, Kamesh | en_US |
dc.date.accessioned | 2016-03-27T15:30:35Z | |
dc.date.accessioned | 2019-05-28T04:38:42Z | - |
dc.date.available | 2016-03-27T15:30:35Z | |
dc.date.available | 2019-05-28T04:38:42Z | - |
dc.date.issued | 2006 | |
dc.identifier.other | CCS_PGP_P6_100 | - |
dc.identifier.uri | http://repository.iimb.ac.in/handle/123456789/5539 | |
dc.description.abstract | This project has made an attempt to solve the multi-level concentrator location problem (MCLP). This problem is a special case of capacitated network design problem. This problem is a great concern in the domain of supply chain management where the distribution networks and the location of those network centers are important. The problem can be conceptualized as something where several computer terminals or user nodes have to be connected to central processing unit or the root node. The traffic from root nodes to the central processing units are controlled by links which are high capacity lines. There are different levels of concentrators which have limited capacity. Each user node or concentrator is connected to at most one concentrator with higher capacity and this introduces hierarchy or levels in the network. The solution to the MCLP problem determines the most economic way of connecting user node to the root node using concentrators. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Indian Institute of Management Bangalore | en_US |
dc.relation.ispartofseries | Contemporary Concerns Study;CCS.PGP.P6-100 | en_US |
dc.title | Multi level concentrator location problem | en_US |
dc.type | CCS Project Report-PGP | en_US |
Appears in Collections: | 2006 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
p6-100(e29550).pdf | 138.18 kB | Adobe PDF | View/Open Request a copy |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.