Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

References

• Atamtürk A. Cover and pack inequalities for (mixed) integer programming. Ann. Opre. Res. (2005) 139:21–38Crossref, Google Scholar
• Atamtürk A, Narayanan V. Polymatroids and risk minimization in discrete optimization. Oper. Res. Lett. (2008) 36:618–622Crossref, Google Scholar
• Atamtürk A, Narayanan V. The submodular 0–1 knapsack polytope. Discrete Optim. (2009) 6:333–344Crossref, Google Scholar
• Atamtürk A, Narayanan V. Conic mixed-integer rounding cuts. Math. Programming (2010) 122:1–20Crossref, Google Scholar
• Atamtürk A, Narayanan V. Lifting for conic mixed-integer programming. Math. Programming (2011) 126:351–363Crossref, Google Scholar
• Balas E. Facets of the knapsack polytope. Math. Programming (1975) 8:146–164Crossref, Google Scholar
• Boyd S, Vandenberghe L. Convex Optimization (2004) (Cambridge University Press, New York) Crossref, Google Scholar
• Büsing C, Koster AMCA, Kutschka M. Recoverable robust knapsacks: The discrete scenario case. Optim. Lett. (2011) 5(3):379–392Crossref, Google Scholar
• Cezik MT, Iyengar G. Cuts for mixed 0–1 conic programming. Math. Programming (2005) 104:179–202Crossref, Google Scholar
• Crowder H, Johnson EL, Padberg M. Solving large-scale 0–1 linear programming problems. Oper. Res. (1983) 31:803–834Link, Google Scholar
• Ferreira CE, Martin A, Weismantel R. Solving multiple knapsack problems by cutting planes. SIAM J. Optim. (1996) 6:858–877Crossref, Google Scholar
• Fujishige S. Submodular Functions and Optimization (2005) Vol. 58(Elsevier B.V., Amsterdam) Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP. Lifted cover inequalities for 0–1 integer programs: Computation. INFORMS J. Comput. (1998) 10:427–437Link, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP. Lifted cover inequalities for 0–1 integer programs: Complexity. INFORMS J. Comput. (1999) 11:117–123Link, Google Scholar
• Hammer PL, Johnson EL, Peled UN. Facet of regular 0–1 polytopes. Math. Programming (1975) 8:179–206Crossref, Google Scholar
• Hartvigsen D, Zemel E. The complexity of lifted inequalities for the knapsack problem. Discrete Appl. Math. (1992) 39:113–123Crossref, Google Scholar
• Iwata S. Submodular function minimization. Math. Programming (2008) 112:45–64Crossref, Google Scholar
• Johnson EL, Padberg MW. A note of the knapsack problem with special ordered sets. Oper. Res. Lett. (1981) 1:18–22Crossref, Google Scholar
• Kaparis K, Letchford AN. Cover inequalities. (2010) . Technical report, Lancaster UniversityGoogle Scholar
• Karp RM, Miller RE, Thatcher JW. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85–103Crossref, Google Scholar
• Klabjan D, Nemhauser GL, Tovey C. The complexity of cover inequality separation. Oper. Res. Lett. (1998) 23:35–40Crossref, Google Scholar
• Klopfenstein O, Nace D. Cover inequalities for a robust knapsack sets—Application to the robust bandwidth packing problem. Networks (2012) 59(1):59–72Crossref, Google Scholar
• Nemhauser GL, Vance PH. Lifted cover facets of the 0–1 knapsack polytope with GUB constraints. Opre. Res. Lett. (1994) 16:255–263Crossref, Google Scholar
• Wolsey LA. Faces for a linear inequality in 0–1 variables. Math. Programming (1975) 8:165–178Crossref, Google Scholar
• Wolsey LA. Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints. Discrete Appl. Math. (1990) 29:251–261Crossref, Google Scholar
• Zemel E. Easily computable facets of the knapsack polytope. Math. Oper. Res. (1989) 14:760–764Link, Google Scholar