Facets of two-dimensional infinite group problems

Mathematics of Operations Research

Volumn 33, Issue 1, 2008, Pages 140-166

  Dey, Santanu S ^a   Richard, Jean Philippe P ^a  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

Infinite group problem; Mixed integer programs; Multiple constraints; Polyhedral theory

Indexed keywords

BUILDING BLOCKS; FACET-DEFINING INEQUALITIES; FIRST CONSTRUCTIONS; INFINITE GROUP PROBLEM; MIXED INTEGER PROGRAMS; MIXED INTEGERS; MULTIPLE CONSTRAINTS; ONE-DIMENSIONAL; PIECE-WISE LINEAR; PIECE-WISE LINEAR FUNCTIONS; POLYHEDRAL THEORY; VALID INEQUALITIES;

PIECEWISE LINEAR TECHNIQUES; TWO DIMENSIONAL;

INTEGER PROGRAMMING;

EID: 58049128596     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1070.0283     Document Type: Article

References (20)

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