Concentrator location in telecommunications

dc.citation.epage	177	en_US
dc.citation.issueNumber	2	en_US
dc.citation.spage	175	en_US
dc.citation.volumeNumber	2	en_US
dc.contributor.author	Yaman, H.	en_US
dc.date.accessioned	2016-02-08T10:25:20Z
dc.date.available	2016-02-08T10:25:20Z
dc.date.issued	2004	en_US
dc.department	Department of Industrial Engineering	en_US
dc.description.abstract	We survey the main results in the author's PhD Thesis presented in December 2002 at the Université Libre de Bruxelles and supervised by Prof. Martine Labbé. The dissertation is written in English and is available at smg.ulb.ac.be. Several versions of concentrator location problems in telecommunication networks are studied. The thesis presents a list of polyhedral results for these problems and a branch and cut algorithm for the most general problem introduced.	en_US
dc.description.provenance	Made available in DSpace on 2016-02-08T10:25:20Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2004	en
dc.identifier.doi	10.1007/s10288-003-0030-6	en_US
dc.identifier.issn	1619-4500
dc.identifier.uri	http://hdl.handle.net/11693/24185
dc.language.iso	English	en_US
dc.publisher	Springer	en_US
dc.relation.isversionof	http://dx.doi.org/10.1007/s10288-003-0030-6	en_US
dc.source.title	4 OR	en_US
dc.subject	Branch and cut	en_US
dc.subject	Concentrator location	en_US
dc.subject	Polyhedral theory	en_US
dc.title	Concentrator location in telecommunications	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1