Cutting planes for programs with disjunctive constraints-Reference-Cited by-同舟云学术

Cutting planes for programs with disjunctive constraints

Published:1973-01 Issue:1 Volume:11 Page:49-55
ISSN:0022-3239
Container-title:Journal of Optimization Theory and Applications
language:en
Short-container-title:J Optim Theory Appl

Author:

Owen G.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF00934290.pdf

Reference6 articles.

1. Lemke, C. E.,On Complementary Pivot Theory, Mathematics of the Decision Sciences, Part 1, Edited by G. B. Dantzig and A. F. Veinott, American Mathematical Society, Providence, Rhode Island, 1968.

2. Glover, F.,Convexity Cuts, University of Texas, School of Business, Working Paper, 1969.

3. Balas, E.,Intersection Cuts?A New Type of Cutting Planes for Integer Programming, Operations Research, Vol. 19, No. 1, 1971.

4. Young, R. D.,New Cuts for a Special Class of 0?1 Integer Programs, Rice University, Research Report, 1968.

5. Young, R. D.,Hypercylindrically Deduced Cuts in Zero?One Integer Programs, Operations Research, Vol. 19, No. 6, 1971.

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

1. Operational Research: methods and applications;Journal of the Operational Research Society;2023-12-27

2. Branch-and-cut for linear programs with overlapping SOS1 constraints;Mathematical Programming Computation;2017-06-13

3. Degeneracy removal in cutting plane methods for disjoint bilinear programming;Optimization Letters;2016-02-15

4. Disjunctive programming: Properties of the convex hull of feasible points;Discrete Applied Mathematics;1998-12

5. Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey;Handbook of Combinatorial Optimization;1998