Erratum: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems (Computational Optimization and Applications DOI: 10.1007/s10589-012-9503-x)

Fayed H.A.; Atiya A.F.

首页> 外文期刊>Computational optimization and applications >Erratum: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems (Computational Optimization and Applications DOI: 10.1007/s10589-012-9503-x)

【24h】

Erratum: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems (Computational Optimization and Applications DOI: 10.1007/s10589-012-9503-x)

机译：勘误表：欧氏k中心问题的分支和界树的混合广度优先策略（计算优化和应用DOI：10.1007 / s10589-012-9503-x）

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

著录项
相似文献
相关主题

著录项

来源
《Computational optimization and applications》 |2013年第3期|共1页
作者
Fayed H.A.; Atiya A.F.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类最优化的数学理论;
关键词

相似文献

外文文献
中文文献
专利

1. Erratum: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems (Computational Optimization and Applications DOI: 10.1007/s10589-012-9503-x) [J] . Fayed H.A., Atiya A.F. Computational optimization and applications . 2013,第3期

机译：勘误表：欧氏k中心问题的分支和界树的混合广度优先策略（计算优化和应用DOI：10.1007 / s10589-012-9503-x）
2. Erratum: A trust region method for solving semidefinite programs (Computational Optimization and Applications DOI: 10.1007/s10589-012-9514-7) [J] . Huang A., Xu C. Computational optimization and applications . 2013,第1期

机译：勘误：一种求解半定程序的信任域方法（计算优化和应用程序DOI：10.1007 / s10589-012-9514-7）
3. Erratum: Component and system reliability-based topology optimization using a single-loop method (Structural and Multidisciplinary Optimization DOI: 10.1007/s00158-009-0401-5) [J] . Silva M., Tortorelli D.A., Norato J.A., Structural and multidisciplinary optimization . 2010,第5期

机译：勘误：使用单环方法基于组件和系统可靠性的拓扑优化（结构和多学科优化DOI：10.1007 / s00158-009-0401-5）
4. Efficient Buffer Tree Creation Using Mixed Branch and Bound and Dynamic Programming Techniques [C] . Amir Hossein Rabbani, Frederic Mailhot International Symposium on Signals, Systems and Electronics . 2007

机译：使用混合分支和绑定和动态编程技术创建高效的缓冲树
5. Learning from the Banyan tree: Branching through cross-application as a strategy for high-tech entrepreneurial innovation. [D] . Banerjee, Preeta Mona. 2006

机译：向榕树学习：通过交叉应用分支作为高科技企业创新的战略。
6. Erratum to: Journal of Computational Neuroscience, DOI 10.1007/s10827-010-0303-y and DOI 10.1007/s10827-010-0304-x [O] . John L. Baker, Tamara Perez-Rosello, Michele Migliore, 2011

机译：错误到：计算神经科学，DOI 10.1007 / S10827-010-0303-Y和DOI 10.1007 / S10827-010-0304-x

Erratum: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems (Computational Optimization and Applications DOI: 10.1007/s10589-012-9503-x)

著录项

相似文献

相关主题

期刊订阅