Sequential pairing of mixed integer inequalities

Lecture Notes in Computer Science

Volumn 3509, Issue , 2005, Pages 23-34

  Guan, Yongpei ^a   Ahmed, Shabbir ^a   Nemhauser, George L ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; NUMBER THEORY; NUMERICAL METHODS; RANDOM PROCESSES; SET THEORY;

EXPONENTIAL NUMBER; INTEGER INEQUALITIES; NON-DOMINATED INEQUALITIES; PAIR-WISE COMBINATIONS;

INTEGER PROGRAMMING;

EID: 24944443290     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496915_3     Document Type: Conference Paper

References (9)

1. A. Atamtürk, G. L. Nemhauser and M. W. P. Savelsbergh. The mixed vertex packing problem. Mathematical Programming, 89:35-53, 2000.
2. I. Barany, T. Van Roy, and L. A. Wolsey. Strong formulations for multi-item capacitated lot sizing. Management Science, 30:1255-1262, 1984.
3. J. R. Birge and F. Louveaux. Introduction to Stochastic Programming. Springer, 1997.
4. Y. Guan, S. Ahmed, and G. L. Nemhauser. Sequential pairing of mixed integer inequalities. Technical Report No. TLI-04-04, School of Industrial & Systems Engineering, Georgia Institute of Technology, 2004.
5. Y. Guan, S. Ahmed, G. L. Nemhauser, and A. J. Miller. A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. To appear in Mathematical Programming, 2005.
6. O. Günluk and Y. Pochet. Mixing mixed-integer inequalities. Mathematical Programming, 90:429-457, 2001.
7. M. Loparic, H. Marchand and L. A. Wolsey. Dynamic knapsack sets and capacitated lot-sizing. Mathematical Programming, 95:53-69, 2003.
8. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
9. G. L. Nemhauser and L. A. Wolsey. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Mathematical Programming, 46:379-390, 1990.