A Branch-and-Cut Algorithm for the Bandwidth Packing Problem
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Park, Kyungchul | - |
| dc.contributor.author | Kang, Seokhoon | - |
| dc.contributor.author | Park, Sungsoo | - |
| dc.date.accessioned | 2013-03-14T05:06:13Z | - |
| dc.date.available | 2013-03-14T05:06:13Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1994 | - |
| dc.identifier.citation | Int. Symp. on Math. Prog., v., no., pp.1 - 161 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/105540 | - |
| dc.language | ENG | - |
| dc.title | A Branch-and-Cut Algorithm for the Bandwidth Packing Problem | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.beginningpage | 1 | - |
| dc.citation.endingpage | 161 | - |
| dc.citation.publicationname | Int. Symp. on Math. Prog. | - |
| dc.identifier.conferencecountry | United States | - |
| dc.identifier.conferencecountry | United States | - |
| dc.contributor.localauthor | Park, Sungsoo | - |
| dc.contributor.nonIdAuthor | Park, Kyungchul | - |
| dc.contributor.nonIdAuthor | Kang, Seokhoon | - |
- Appears in Collection
- IE-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.