Facets of Two-Dimensional Infinite Group Problems

References

• Aczél J.Lectures on Functional Equations and Their Applications (1966) (Academic Press, New York) Google Scholar
• Andersen K., Cornuéjols G., Li Y. Reduce-and-split cuts: Improving the performance of mixed integer Gomory cuts. Management Sci. (2005) 51(11):1720–1732Link, Google Scholar
• Aráoz J., Evans L., Gomory R. E., Johnson E. L. Cyclic groups and knapsack facets. Math. Programming (2003) 96:377–408Crossref, Google Scholar
• Cornuéjols G., Li Y., Vandenbussche D. K-cuts: A variation of Gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. (2003) 15(4):385–396Link, Google Scholar
• Dash S., Günlük O. On the strength of Gomory mixed integer cuts as group cuts. (2006) . Technical Report RC23967, IBM Research report, Yorktown Heights, NYGoogle Scholar
• Dey S. S. Strong cutting planes for unstructured mixed integer programs using multiple constraints. (2007) . Doctoral dissertation, Purdue University, West Lafayette, INGoogle Scholar
• Dey S. S., Richard J.-P. P., Li Y., Miller L. A. Extreme inequalities for infinite group problems. (2006) . http://www.optimization-online.org/DB_HTML/2006/04/1356.htmlGoogle Scholar
• Gomory R. E., Graves R. L., Wolfe P. An algorithm for integer solutions to linear programs. Recent Advances in Mathematical Programming (1963) (McGraw-Hill Book Company Inc., New York) 269–308Google Scholar
• Gomory R. E. Some polyhedra related to combinatorial problems. J. Linear Algebra Appl. (1969) 2:341–375Crossref, Google Scholar
• Gomory R. E., Johnson E. L. Some continuous functions related to corner polyhedra, part I. Math. Programming (1972) 3:23–85Crossref, Google Scholar
• Gomory R. E., Johnson E. L. Some continuous functions related to corner polyhedra, part II. Math. Programming (1972) 3:359–389Crossref, Google Scholar
• Gomory R. E., Johnson E. L. T-space and cutting planes. Math. Programming (2003) 96:341–375Crossref, Google Scholar
• Gomory R. E., Johnson E. L., Evans L. Corner polyhedra and their connection with cutting planes. Math. Programming (2003) 96:321–339Crossref, Google Scholar
• Johnson E. L. On the group problem for mixed integer programming. Math. Programming Study (1974) 2:137–179Crossref, Google Scholar
• Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P. Progress in linear programming-based algorithms for integer programming: An exposition. INFORMS J. Comput. (2000) 12(1):2–23Link, Google Scholar
• Marchand H., Wolsey L. A. Aggregation and mixed integer rounding to solve MIPs. Oper. Res. (2001) 49(3):363–371Link, Google Scholar
• Marchand H., Martin A., Weismantel R., Wolsey L. A. Cutting planes in integer and mixed integer programming. Discrete Appl. Math. (2002) 123:397–446Crossref, Google Scholar
• Miller L. A., Li Y., Richard J.-P. P. New facets for finite and infinite group problems from approximate lifting. (2006) . Technical Report MN-ISYE-TR-06-004, University of Minnesota Graduate Program in Industrial and Systems Engineering, MinneapolisGoogle Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley InterScience, New York) Crossref, Google Scholar
• Richard J.-P. P., Li Y., Miller L. A. Strong valid inequalities for MIPs and group polyhedra from approximate lifting. Math. Programming (2007) . ForthcomingGoogle Scholar