![Theoretical computer science / Combinatorial optimization / Knapsack problem / Cutting-plane method / Linear programming relaxation / Linear programming / Simplex algorithm / Dynamic programming / Mathematical optimization / Operations research / Applied mathematics Theoretical computer science / Combinatorial optimization / Knapsack problem / Cutting-plane method / Linear programming relaxation / Linear programming / Simplex algorithm / Dynamic programming / Mathematical optimization / Operations research / Applied mathematics](https://www.pdfsearch.io/img/70183187410383c1213d735de9a35705.jpg) Date: 2008-04-11 12:49:59Theoretical computer science Combinatorial optimization Knapsack problem Cutting-plane method Linear programming relaxation Linear programming Simplex algorithm Dynamic programming Mathematical optimization Operations research Applied mathematics | | On the Exact Separation of Mixed Integer Knapsack Cuts Ricardo Fukasawa1 and Marcos Goycoolea2 1 H. Milton Stewart School of Industrial and Systems EngineeringAdd to Reading ListSource URL: mgoycool.uai.clDownload Document from Source Website File Size: 170,83 KBShare Document on Facebook
|