Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable

References

• Achterberg T., Koch T., Martin A. Mixed Integer Problem Library (MIPLIB) 2003. (2006) . Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin. Retrieved February 21, 2011, http://miplib.zib.deGoogle Scholar
• Applegate D., Bixby R., Chvátal V., Cook W. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Programming (2003) 97(1–2):91–153Crossref, Google Scholar
• Atamtürk A. On the facets of the mixed–integer knapsack polyhedron. Math. Programming (2003) 98(1–3):145–175Crossref, Google Scholar
• Avella P., Boccia M., Vasilyev I. A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. (2010) 45(3):543–555Crossref, Google Scholar
• Boyd E. A. Generating Fenchel cutting planes for knapsack polyhedra. SIAM J. Optim. (1993) 3(4):734–750Crossref, Google Scholar
• Dash Optimization Xpress-Optimizer reference manual, release 18. (2007) (Fair Isaac, Blisworth, UK) Google Scholar
• Fukasawa R., Goycoolea M. On the exact separation of mixed integer knapsack cuts. Math. Programming (2011) 128(1–2):19–41Crossref, Google Scholar
• Kaparis K., Letchford A. N. Separation algorithms for 0–1 knapsack polytopes. Math. Programming (2010) 124(1–2):69–91Crossref, Google Scholar
• Marchand H., Wolsey L. A. The 0–1 knapsack problem with a single continuous variable. Math. Programming (1999) 85(1):15–33Crossref, Google Scholar
• Mittelmann H. MILP testcases. (2010) . Retrieved January 31, 2011, http://plato.asu.edu/ftp/milpGoogle Scholar
• Pisinger D. A minimal algorithm for the bounded knapsack problem. INFORMS J. Comput. (2000) 12(1):75–82Link, Google Scholar
• Wolsey L. A. Facets and strong valid inequalities for integer programs. Oper. Res. (1976) 24(2):367–372Link, Google Scholar
• Wolter K. Implementation of cutting plane separators for mixed integer programs. (2006) . Ph.D. thesis, Technische Universitat Berlin, BerlinGoogle Scholar
• Zuse Institute Berlin SCIP—Solving Constraint Integer Problems. (2007) . Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin. http://scip.zib.deGoogle Scholar