咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 电气工程
    • 1 篇 信息与通信工程
    • 1 篇 计算机科学与技术...

主题

  • 1 篇 surveys
  • 1 篇 optimization
  • 1 篇 np-hard problem
  • 1 篇 pruning strategy
  • 1 篇 enhanced branch ...
  • 1 篇 dispatching
  • 1 篇 power distributi...
  • 1 篇 search problems
  • 1 篇 power dispatchin...
  • 1 篇 problem-solving
  • 1 篇 branch and bound...
  • 1 篇 machine learning...

机构

  • 1 篇 istanbul medeniy...
  • 1 篇 bennett univ sch...

作者

  • 1 篇 cesur muhammet r...
  • 1 篇 cesur elif
  • 1 篇 abraham ajith

语言

  • 1 篇 英文
检索条件"主题词=enhanced branch and bound algorithm"
1 条 记 录,以下是1-10 订阅
排序:
enhanced branch and bound algorithm: Minimizing Subproblem Complexity in Power Dispatch
收藏 引用
IEEE ACCESS 2024年 12卷 93753-93760页
作者: Cesur, Elif Cesur, Muhammet Rasit Abraham, Ajith Istanbul Medeniyet Univ Ind Engn Dept TR-34700 Istanbul Turkiye Bennett Univ Sch Comp Sci Engn & Technol Greater Noida 201310 Uttar Pradesh India
The branch and bound (BB) algorithm, while ensuring optimality, often encounters performance bottlenecks, characterized by slow execution and high computational overhead, especially when dealing with intricate or exte... 详细信息
来源: 评论