Improving the solution time of integer programs by merging knapsack constraints with cover inequalities
Master of Science === Department of Industrial and Manufacturing Systems Engineering === Todd Easton === Integer Programming is used to solve numerous optimization problems. This class of mathematical models aims to maximize or minimize a cost function restricted to some constraints and the solution...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
Kansas State University
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2097/19226 |