DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS

Published:1975 Issue: Volume: Page:279-312
ISSN:
Container-title:Nonlinear Programming 2
language:
Short-container-title:

Author:

Balas Egon

Publisher

Elsevier

Reference26 articles.

1. Integer programming and convex analysis: Intersection cuts from outer polars

2. “Nonconvex Quadratic Programming.”;Balas,1972

3. Balas, E. (August 27-31, 1973) “On the Use of Intersection Cuts in Branch and Bound.” Paper presented at the 8th International Symposium on Mathematical Programming, Stanford, California.

4. “Intersection Cuts from Disjunctive Constraints.”;Balas,1974

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

1. Exact and Approximation Algorithms for Sparse Principal Component Analysis;INFORMS Journal on Computing;2024-07-01

2. Modeling combinatorial disjunctive constraints via junction trees;Mathematical Programming;2023-04-26

3. Specifying and Reasoning about CPS through the Lens of the NIST CPS Framework;Theory and Practice of Logic Programming;2022-03-04

4. Ideal, non-extended formulations for disjunctive constraints admitting a network representation;Mathematical Programming;2021-04-16

5. Reasoning About Trustworthiness in Cyber-Physical Systems Using Ontology-Based Representation and ASP;PRIMA 2020: Principles and Practice of Multi-Agent Systems;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP