摘要: Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and …
core.ac.uk
springer.com
umontreal.ca 
researchgate.net 
sci-hub.se 参考文章(82)
Bryant, Graph-Based Algorithms for Boolean Function Manipulation IEEE Transactions on Computers. ,vol. 35, pp. 677- 691 ,(1986) , 10.1109/TC.1986.1676819
G. Mitra, Investigation of some branch and bound strategies for the solution of mixed integer linear programs Mathematical Programming. ,vol. 4, pp. 155- 170 ,(1973) , 10.1007/BF01584658
Laurence A. Wolsey, Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints Discrete Applied Mathematics. ,vol. 29, pp. 251- 261 ,(1990) , 10.1016/0166-218X(90)90148-6
Vipul Jain, Ignacio E. Grossmann, Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems Informs Journal on Computing. ,vol. 13, pp. 258- 276 ,(2001) , 10.1287/IJOC.13.4.258.9733
Alberto Ceselli, Michael Gatto, Marco E. Lübbecke, Marc Nunkesser, Heiko Schilling, Optimizing the Cargo Express Service of Swiss Federal Railways Transportation Science. ,vol. 42, pp. 450- 465 ,(2008) , 10.1287/TRSC.1080.0246
M. W. P. Savelsbergh, Preprocessing and Probing Techniques for Mixed Integer Programming Problems Informs Journal on Computing. ,vol. 6, pp. 445- 454 ,(1994) , 10.1287/IJOC.6.4.445
Alexander Martin, Robert Weismantel, The Intersection of Knapsack Polyhedra and Extensions integer programming and combinatorial optimization. pp. 243- 256 ,(1998) , 10.1007/3-540-69346-7_19
J. T. Linderoth, M. W. P. Savelsbergh, A Computational Study of Search Strategies for Mixed Integer Programming Informs Journal on Computing. ,vol. 11, pp. 173- 187 ,(1999) , 10.1287/IJOC.11.2.173
Adam N. Letchford, Andrea Lodi, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts Operations Research Letters. ,vol. 30, pp. 74- 82 ,(2002) , 10.1016/S0167-6377(02)00112-8
Alper Atamt�rk, On capacitated network design cut-set polyhedra Mathematical Programming. ,vol. 92, pp. 425- 437 ,(2002) , 10.1007/S101070100284