The existence and usefulness of equality cuts in the multi-demand multidimensional knapsack problem
Master of Science === Department of Industrial and Manufacturing Systems Engineering === Todd Easton === Integer programming (IP) is a class of mathematical models useful for modeling and optimizing many theoretical and industrial problems. Unfortunately, IPs are NP-complete, and many integer progra...
Main Author: | DeLissa, Levi |
---|---|
Language: | en_US |
Published: |
Kansas State University
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/2097/17399 |
Similar Items
-
Generating cutting planes through inequality merging for integer programming problems
by: Hickman, Randal Edward
Published: (2014) -
Exact synchronized simultaneous uplifting over arbitrary initial inequalities for the knapsack polytope
by: Beyer, Carrie Austin
Published: (2011) -
Improving the solution time of integer programs by merging knapsack constraints with cover inequalities
by: Vitor, Fabio Torres
Published: (2015) -
Lifted equality cuts for the multiple knapsack equality problem
by: Talamantes, Alonso
Published: (2017) -
Octanary branching algorithm
by: Bailey, James Patrick
Published: (2012)