Sequential-merge facets for two-dimensional group problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4513 LNCS, Issue , 2007, Pages 30-42

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

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING;

CONTINUOUS VARIABLE COEFFICIENTS; CUTTING PLANES; FACET DEFINING INEQUALITIES; SEQUENTIAL MERGE INEQUALITIES;

INTEGER PROGRAMMING;

EID: 38049042276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_3     Document Type: Conference Paper

References (15)

1. K. Aardal, R. Weismantel, and L. A. Wolsey. Non-standard approaches to integer programming. Discrete Applied Mathematics, 123:5-74, 2002.
2. J. Aráoz, L. Evans, R. E. Gomory, and E. L. Johnson. Cyclic groups and knapsack facets. Mathematical Programming, 96:377-408, 2003.
3. S. Dash and O. Günlük. Valid inequalities based on simple mixed integer set. Mathematical Programming, 106:29-53, 2006.
4. S. S. Dey and J.-P. P. Richard. Facets of two-dimensional infinite group problems. Under Review, 2006. http://www.optimization-online.org/DB_HTML/ 2006/01/1280.html.
5. S. S. Dey, J.-P. P. Richard, L. A. Miller, and Y. Li. Extreme inequalities for infinite group problems. 2006. http://www.optimization-online. org/DB_HTML/2006/04/1356.html.
6. R. E. Gomory. Some polyhedra related to combinatorial problems. Journal of Linear Algebra and Applications, 2:341-375, 1969.
7. R. E. Gomory and E. L. Johnson. Some continuous functions related to corner polyhedra, part I. Mathematical Programming, 3:23-85, 1972.
8. R. E. Gomory and E. L. Johnson. Some continuous functions related to corner polyhedra, part II. Mathematical Programming, 3:359-389, 1972.
9. R. E. Gomory and E. L. Johnson. T-space and cutting planes. Mathematical Programming, 96:341-375, 2003.
10. R. E. Gomory, E. L. Johnson, and L. Evans. Corner polyhedra and their connection with cutting planes. Mathematical Programming, 96:321-339, 2003.
11. E. L. Johnson. On the group problem for mixed integer programming. Mathematical Programming Study, 2:137-179, 1974.
12. E. L. Johnson, G. L. Nemhauser, and M. W. P. Savelsbergh. Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS Journal of Computing, 12:2-23, 2000.
13. H. Marchand, A. Martin, R. Weismantel, and L. A. Wolsey. Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics, 123:397-446, 2002.
14. L. Miller, Y. Li, and J.-P. P. Richard. 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, 2006.
15. J.-P. P. Richard, Y. Li, and L. A. Miller. Strong valid inequalities for mips and group polyhedra from approximate lifting. Under Review, 2006.