咨询与建议

限定检索结果

文献类型

  • 49 篇 期刊文献
  • 7 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 34 篇 工学
    • 28 篇 计算机科学与技术...
    • 7 篇 电气工程
    • 7 篇 软件工程
    • 3 篇 信息与通信工程
    • 3 篇 控制科学与工程
    • 2 篇 交通运输工程
    • 1 篇 土木工程
  • 33 篇 理学
    • 28 篇 数学
    • 3 篇 生物学
    • 3 篇 统计学(可授理学、...
    • 2 篇 系统科学
    • 1 篇 地理学
  • 29 篇 管理学
    • 29 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 5 篇 经济学
    • 2 篇 理论经济学
    • 2 篇 应用经济学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 56 篇 branch-and-bound...
  • 11 篇 global optimizat...
  • 3 篇 concave minimiza...
  • 3 篇 computational bi...
  • 3 篇 gpu computing
  • 2 篇 approximation al...
  • 2 篇 hill-climbing
  • 2 篇 massively parall...
  • 2 篇 strong independe...
  • 2 篇 symmetry
  • 2 篇 flow-shop schedu...
  • 2 篇 spatial database...
  • 2 篇 r-tree
  • 2 篇 sum of ratios
  • 2 篇 optimization
  • 2 篇 fractional progr...
  • 2 篇 integer programm...
  • 2 篇 multiplicative p...
  • 2 篇 lipschitz optimi...
  • 2 篇 combinatorial op...

机构

  • 2 篇 hong kong univ s...
  • 2 篇 univ calabria de...
  • 2 篇 univ florida war...
  • 2 篇 alexandru ioan c...
  • 2 篇 univ wisconsin d...
  • 2 篇 univ cyprus dept...
  • 2 篇 city univ hong k...
  • 2 篇 univ lille 1 cnr...
  • 2 篇 inst math hanoi ...
  • 2 篇 univ nizhni novg...
  • 1 篇 york univ schuli...
  • 1 篇 univ london birk...
  • 1 篇 univ giessen fac...
  • 1 篇 natl taiwan univ...
  • 1 篇 ecole cent paris...
  • 1 篇 univ florida dep...
  • 1 篇 dfki gmbh german...
  • 1 篇 univ szeged inst...
  • 1 篇 natl chung hsing...
  • 1 篇 univ mons dept m...

作者

  • 4 篇 melab n.
  • 4 篇 chakroun i.
  • 3 篇 thoai nv
  • 2 篇 sergeyev yd
  • 2 篇 moral serafin
  • 2 篇 horst r
  • 2 篇 bendjoudi a.
  • 2 篇 cano andres
  • 2 篇 vassilakopoulos ...
  • 2 篇 pugliese p
  • 2 篇 famularo d
  • 2 篇 corral a
  • 2 篇 linderoth jeff
  • 2 篇 benson h. p.
  • 2 篇 gatu cristian
  • 2 篇 cheng tce
  • 2 篇 ostrowski james
  • 2 篇 mezmaz m.
  • 2 篇 benson hp
  • 2 篇 gomez manuel

语言

  • 53 篇 英文
  • 3 篇 其他
检索条件"主题词=branch-and-bound algorithms"
56 条 记 录,以下是51-60 订阅
排序:
Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network
Efficiently Enumerating All Connected Induced Subgraphs of a...
收藏 引用
1st International Conference on algorithms for Computational Biology (AlCoB)
作者: Maxwell, Sean Chance, Mark R. Koyutuerk, Mehmet Case Western Reserve Univ Ctr Prote & Bioinformat Cleveland OH 44106 USA Case Western Reserve Univ Dept Elect Engn & Comp Sci Cleveland OH 44106 USA
In systems biology, the solution space for a broad range of problems is composed of sets of functionally associated biomolecules. Since connectivity in molecular interaction networks is an indicator of functional asso... 详细信息
来源: 评论
Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2013年 第8期25卷 1121-1136页
作者: Chakroun, I. Mezmaz, M. Melab, N. Bendjoudi, A. Univ Lille 1 CNRS LIFL INRIA Lille Nord Europe F-59655 Villeneuve Dascq France Univ Mons Math & Operat Res Dept MathRO B-7000 Mons Belgium Ctr Rech Informat Sci & Tech CERIST Algiers 16030 Algeria
In this paper, we address the design and implementation of graphical processing unit (GPU)-accelerated branch-and-bound algorithms (B&B) for solving flow-shop scheduling optimization problems (FSP). Such applicati... 详细信息
来源: 评论
Minimizing the Total Tardiness of a Game Project Considering the Overlap Effect
收藏 引用
IEEE ACCESS 2020年 8卷 216507-216518页
作者: Wang, Jen-Ya Chen, Meng-Wei Jea, Kuen-Fang Hungkuang Univ Dept Comp Sci & Informat Management Taichung 43302 Taiwan Natl Chung Hsing Univ Dept Comp Sci & Engn Taichung 40227 Taiwan
There has long been a custom that game development is not the mainstream of engineering and its tardiness brings little or even no harm to this industry. Nowadays, the pendulum of industrial development has swung to a... 详细信息
来源: 评论
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison
收藏 引用
EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 2012年 第1-2期1卷 113-133页
作者: Roberti, Roberto Toth, Paolo Univ Bologna DEIS Viale Risorgimento 2 I-40136 Bologna BO Italy
This paper surveys the most effective mathematical models and exact algorithms proposed for finding the optimal solution of the well-known Asymmetric Traveling Salesman Problem (ATSP). The fundamental Integer Linear P... 详细信息
来源: 评论
ANALYSIS OF DIFFERENT NORMS AND CORRESPONDING LIPSCHITZ CONSTANTS FOR GLOBAL OPTIMIZATION
收藏 引用
Technological & Economic Development of Economy 2006年 第4期12卷 301-306页
作者: Paulavičius, Remigijus r.paulavicius@vpu.lt Žilinskas, Julius julius.zilinskas@mii.lt Vilnius Pedagogical University Studentų g. 39 LT-08106 Vilnius Lithuania Institute of Mathematics and Informatics Akademijos g. 4 LT-08663 Vilnius Lithuania
The paper discusses how the used norm and corresponding Lipschitz constant influence the speed of algorithms for global optimization. For this reason Lipschitz constants corresponding to different norms were estimated... 详细信息
来源: 评论
SEARCH algorithms UNDER DIFFERENT KINDS OF HEURISTICS - A COMPARATIVE-STUDY
收藏 引用
JOURNAL OF THE ACM 1983年 第1期30卷 1-21页
作者: BAGCHI, A MAHANTI, A Indian Institute of Management Calcutta P.O. Box 16757 Calcutta-700027 India Indian Institute of Management Calcutta P.O. Box 16757 Calcutta-700027 India
Three heuristic search algorithms, called algorithms A, B, and C, are presented. Their performance, with the admlssib/hty condition relaxed, is compared using the following two criteria: (i) number of node expansions ... 详细信息
来源: 评论