A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
Author:
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/BF00939825.pdf
Reference17 articles.
1. Horst, R.,On the Global Minimization of Concave Functions: Introduction and Survey, Operations Research Spektrum, Vol. 6, pp. 195?205, 1984.
2. Thoai, N., andTuy, H.,Convergent Algorithms for Minimizing a Concave Function, Mathematics of Operations Research, Vol. 5, pp. 556?566, 1980.
3. Falk, I., andSoland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, Management Science, Vol. 15, pp. 550?569, 1969.
4. Soland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, II: Nonconvex Constraints, Management Science, Vol. 17, pp. 759?773, 1971.
5. McCormick, G. P.,Computability of Global Solutions to Factorable Nonconvex Programs, Part I: Convex Underestimating Problems, Mathematical Programming, Vol. 10, pp. 147?175, 1976.
Cited by 82 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chance constrained programs with Gaussian mixture models;IISE Transactions;2022-01-04
2. End-to-end Transmission Link Optimal Selection Method based on Electromagnetic Strength Distribution;Lecture Notes in Electrical Engineering;2022
3. Enabling Dynamically Centralized RAN Architectures in 5G and Beyond;IEEE Transactions on Network and Service Management;2021-09
4. Optimal MIMO Precoding Under a Constraint on the Amplifier Power Consumption;IEEE Transactions on Communications;2019-01
5. Optimizing HIV Interventions for Multiplex Social Networks via Partition-Based Random Search;IEEE Transactions on Cybernetics;2018-12
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3