Valid inequalities based on the interpolation procedure
暂无分享,去创建一个
[1] Ellis L. Johnson,et al. Corner Polyhedra and their connection with cutting planes , 2003, Math. Program..
[2] Craig A. Tovey,et al. Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms , 2003 .
[3] William Mendenhall,et al. Introduction to Probability and Statistics , 1961, The Mathematical Gazette.
[4] Jan Karel Lenstra,et al. History of mathematical programming : a collection of personal reminiscences , 1991 .
[5] Ellis L. Johnson,et al. Cyclic group and knapsack facets , 2003, Math. Program..
[6] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[7] V. Rich. Personal communication , 1989, Nature.
[8] Lisa Evans,et al. Cyclic group and knapsack facets with applications to cutting planes , 2002 .
[9] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[10] W. J. DeCoursey,et al. Introduction: Probability and Statistics , 2003 .
[11] Charles E. Clark,et al. Monte Carlo , 2006 .
[12] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[13] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra, II , 1972, Math. Program..
[14] Ellis L. Johnson,et al. T-space and cutting planes , 2003, Math. Program..
[15] Laurence A. Wolsey,et al. Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..
[16] Sanjeeb Dash,et al. Valid inequalities based on simple mixed-integer sets , 2006, Math. Program..
[17] Gérard Cornuéjols,et al. K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau , 2003, INFORMS J. Comput..