The integer knapsack cover polyhedron
| dc.citation.epage | 572 | en_US |
| dc.citation.issueNumber | 3 | en_US |
| dc.citation.spage | 551 | en_US |
| dc.citation.volumeNumber | 21 | en_US |
| dc.contributor.author | Yaman, H. | en_US |
| dc.date.accessioned | 2016-02-08T10:11:50Z | |
| dc.date.available | 2016-02-08T10:11:50Z | |
| dc.date.issued | 2007 | en_US |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description.abstract | We study the integer knapsack cover polyhedron which is the convex hull of the set of vectors x ∈ ℤ+ n that satisfy C T x ≥ b, with C ∈ ℤ++ n and 6 ∈ ℤ++. We present some general results about the nontrivial facet-defining inequalities. Then we derive specific families of valid inequalities, namely, rounding, residual capacity, and lifted rounding inequalities, and identify cases where they define facets. We also study some known families of valid inequalities called 2-partition inequalities and improve them using sequence-independent lifting. | en_US |
| dc.identifier.doi | 10.1137/050639624 | en_US |
| dc.identifier.eissn | 1095-7146 | |
| dc.identifier.issn | 0895-4801 | |
| dc.identifier.uri | http://hdl.handle.net/11693/23309 | |
| dc.language.iso | English | en_US |
| dc.publisher | Society for Industrial and Applied Mathematics | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1137/050639624 | en_US |
| dc.source.title | SIAM Journal on Discrete Mathematics | en_US |
| dc.subject | Integer knapsack cover polyhedron | en_US |
| dc.subject | Valid inequalities | en_US |
| dc.subject | Sequence-independent lifting | en_US |
| dc.subject | Facets | en_US |
| dc.title | The integer knapsack cover polyhedron | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- The_integer_knapsack_cover_polyhedron.pdf
- Size:
- 280.1 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version