Partial convexification cuts for 0–1 mixed-integer programs-Reference-Cited by-同舟云学术

Partial convexification cuts for 0–1 mixed-integer programs

Published:2005-09 Issue:3 Volume:165 Page:625-648
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Sherali Hanif D.,Lee Youngho,Kim Youngjin

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference14 articles.

1. E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, MSRR No. 348 Carnegie Mellon University, 1974

2. A lift-and-project cutting plane algorithm for mixed 0–1 programs;Balas;Mathematical Programming,1993

3. Mixed 0–1 programming by lift-and-project in a branch-and-cut framework;Balas;Management Science,1995

4. Strengthening cuts for mixed integer programs;Balas;European Journal of Operational Research,1978

5. R.E. Bixby, S. Ceria, C. McZeal, M. Savelsbergh, An updated mixed integer programming library, Technical Report TR98-03 Rice University, Houston, TX, 1998

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reformulation-Linearization Technique Approach for Kidney Exchange Program IT Healthcare Platforms;Applied Sciences;2017-08-17

2. Surrogate-RLT cuts for zero–one integer programs;Journal of Global Optimization;2015-04-03

3. Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem;INFORMS Journal on Computing;2013-08

4. A computational study of the cutting plane tree algorithm for general mixed-integer linear programs;Operations Research Letters;2012-01

5. Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation;Integer Programming and Combinatoral Optimization;2011