咨询与建议

限定检索结果

文献类型

  • 41 篇 期刊文献
  • 35 篇 会议
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 59 篇 工学
    • 35 篇 计算机科学与技术...
    • 23 篇 电气工程
    • 12 篇 控制科学与工程
    • 9 篇 软件工程
    • 6 篇 信息与通信工程
    • 5 篇 机械工程
    • 4 篇 电子科学与技术(可...
    • 2 篇 交通运输工程
    • 1 篇 动力工程及工程热...
    • 1 篇 化学工程与技术
    • 1 篇 生物医学工程(可授...
  • 29 篇 理学
    • 23 篇 数学
    • 4 篇 系统科学
    • 4 篇 统计学(可授理学、...
    • 2 篇 生物学
    • 1 篇 物理学
    • 1 篇 化学
  • 23 篇 管理学
    • 22 篇 管理科学与工程(可...
    • 1 篇 图书情报与档案管...
  • 1 篇 经济学
    • 1 篇 理论经济学
  • 1 篇 医学
    • 1 篇 药学(可授医学、理...

主题

  • 77 篇 branch and bound...
  • 8 篇 algorithms
  • 7 篇 branches
  • 6 篇 global optimizat...
  • 6 篇 branch and bound...
  • 4 篇 dynamic programm...
  • 3 篇 automatic verifi...
  • 3 篇 interval analysi...
  • 3 篇 optimal solution
  • 3 篇 scheduling theor...
  • 2 篇 tardiness
  • 2 篇 approximation al...
  • 2 篇 exact algorithms
  • 2 篇 automatic differ...
  • 2 篇 optimum performa...
  • 2 篇 jobs
  • 2 篇 tree searching
  • 2 篇 network model
  • 2 篇 optimization
  • 2 篇 memory space

机构

  • 4 篇 univ louisiana l...
  • 4 篇 univ illinois de...
  • 3 篇 so illinois univ...
  • 2 篇 department of in...
  • 2 篇 univ trier dept ...
  • 2 篇 univ connecticut...
  • 2 篇 univ louisiana l...
  • 1 篇 natl taiwan univ...
  • 1 篇 centre for wirel...
  • 1 篇 north china elec...
  • 1 篇 vienna univ econ...
  • 1 篇 nanyang technol ...
  • 1 篇 korea adv inst s...
  • 1 篇 department of ma...
  • 1 篇 google res mount...
  • 1 篇 univ sydney univ...
  • 1 篇 univ southampton...
  • 1 篇 research laborat...
  • 1 篇 bell labs murray...
  • 1 篇 computer school ...

作者

  • 4 篇 kearfott ralph b...
  • 3 篇 kao gio k.
  • 3 篇 jacobson sheldon...
  • 3 篇 tyagi gaurav
  • 3 篇 sewell edward c.
  • 2 篇 castille jessie
  • 2 篇 rajasekaran sang...
  • 2 篇 davila jaime
  • 2 篇 balla sudha
  • 2 篇 hyun-jung kim
  • 2 篇 tae-eog lee
  • 2 篇 jun-ho lee
  • 1 篇 li xi
  • 1 篇 ibaraki t
  • 1 篇 gary balas
  • 1 篇 dür m
  • 1 篇 konishi k
  • 1 篇 bouvry p.
  • 1 篇 federico heras
  • 1 篇 potts cn

语言

  • 73 篇 英文
  • 4 篇 其他
检索条件"主题词=Branch and bound algorithms"
77 条 记 录,以下是71-80 订阅
EXPERIMENTAL COMPARISON OF algorithms FOR THE PROBLEM OF THE MAXIMUM SET OF PAIRWISE INCOMPARABLE VERTICES IN A DIGRAPH
收藏 引用
CYBERNETICS AND SYSTEMS ANALYSIS 1992年 第5期28卷 788-791页
作者: VOITISHIN, YV
Two branch-and-bound algorithms are analyzed for the problem of the maximum set of pairwise incomparable vertices in a digraph with additional constraints.
来源: 评论
algorithms FOR NONLINEAR BILEVEL MATHEMATICAL PROGRAMS
收藏 引用
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1991年 第1期21卷 83-89页
作者: EDMUNDS, TA BARD, JF UNIV TEXAS DEPT MECH ENGNOPERAT RES GRPAUSTINTX 78712
The bilevel programming problem (BLPP) is a model of a leader-follower game in which play is sequential and cooperation is not permitted. In the first part of the paper, some basic properties of the general model are ... 详细信息
来源: 评论
STOCHASTIC MODELING OF branch-AND-bound algorithms WITH BEST-1ST SEARCH
收藏 引用
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1985年 第9期11卷 922-934页
作者: WAH, BW YU, CF UNIV ILLINOIS COORDINATED SCI LABURBANAIL 61801 PURDUE UNIV SCH ELECT ENGNW LAFAYETTEIN 47907
An approximate stochastic model of branch-and-bound algorithms with a best-first search is proposed. The average memory space required is estimated and the average number of subproblems expanded before the process ter... 详细信息
来源: 评论
ANALYSIS OF K-NEAREST NEIGHBOR branch AND bound RULES
收藏 引用
PATTERN RECOGNITION LETTERS 1986年 第2期4卷 71-77页
作者: LARSEN, S KANAL, LN UNIV MARYLAND DEPT COMP SCIMACHINE INTELLIGENCE & PATTERN ANAL LABCOLLEGE PKMD 20742
This paper analyzes the applicability and relative efficiency of four pruning rules for finding k -nearest neighbors by a branch and bound algorithm. Results of experimental simulations with various clustering schemes... 详细信息
来源: 评论
STRONG DECISION AND FORECAST HORIZONS IN A CONVEX PRODUCTION PLANNING PROBLEM
收藏 引用
OPTIMAL CONTROL APPLICATIONS & METHODS 1984年 第4期5卷 319-330页
作者: TENG, JT THOMPSON, GL SETHI, SP CARNEGIE MELLON UNIV GRAD SCH IND ADMMANAGEMENT SCI RES GRPPITTSBURGHPA 15213 UNIV TORONTO FAC MANAGEMENT STUDIESTORONTO M5S 1V4ONTARIOCANADA
We consider a production-inventory planning problem with time-varying demands, convex production costs and a warehouse capacity constraint. It is solved by use of the Lagrangian form of the maximum principle. The poss... 详细信息
来源: 评论
DEPTH-M SEARCH IN branch-AND-bound algorithms
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES 1978年 第4期7卷 315-343页
作者: IBARAKI, T Kyoto University
A new search strategy, called depth-msearch, is proposed for branch-and-bound algorithms, wheremis a parameter to be set by the user. In particular, depth-1 search is equivalent to the conventional depth-first search,... 详细信息
来源: 评论
Optimizing Binary Trees Grown with a Sorting Algorithm
收藏 引用
1969年
作者: william a martin
来源: 评论