A branch and cut algorithm for hub location problems with single assignment

Simple item page
dc.citation.epage405en_US
dc.citation.issueNumber2en_US
dc.citation.spage371en_US
dc.citation.volumeNumber102en_US
dc.contributor.authorLabbé, M.en_US
dc.contributor.authorYaman, H.en_US
dc.contributor.authorGourdin, E.en_US
dc.date.accessioned2016-02-08T10:24:02Z
dc.date.available2016-02-08T10:24:02Z
dc.date.issued2005en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThe hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:24:02Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2005en
dc.identifier.doi10.1007/s10107-004-0531-xen_US
dc.identifier.eissn1436-4646
dc.identifier.issn0025-5610
dc.identifier.urihttp://hdl.handle.net/11693/24095
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s10107-004-0531-xen_US
dc.source.titleMathematical Programmingen_US
dc.subjectBranch and cuten_US
dc.subjectHub locationen_US
dc.subjectPolyhedral analysisen_US
dc.titleA branch and cut algorithm for hub location problems with single assignmenten_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_branch_and_cut_algorithm_for_hub_location_problems_with_single_assignment.pdf
Size:
281.67 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering