咨询与建议

限定检索结果

文献类型

  • 216 篇 期刊文献
  • 66 篇 会议
  • 7 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 213 篇 工学
    • 101 篇 计算机科学与技术...
    • 52 篇 电气工程
    • 30 篇 控制科学与工程
    • 27 篇 航空宇航科学与技...
    • 21 篇 机械工程
    • 17 篇 仪器科学与技术
    • 17 篇 信息与通信工程
    • 14 篇 交通运输工程
    • 13 篇 软件工程
    • 9 篇 石油与天然气工程
    • 7 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 化学工程与技术
    • 5 篇 动力工程及工程热...
    • 4 篇 环境科学与工程(可...
    • 3 篇 水利工程
  • 121 篇 管理学
    • 118 篇 管理科学与工程(可...
    • 19 篇 工商管理
  • 79 篇 理学
    • 64 篇 数学
    • 6 篇 生物学
    • 5 篇 系统科学
    • 4 篇 物理学
    • 4 篇 地理学
    • 4 篇 生态学
    • 3 篇 化学
    • 3 篇 地球物理学
    • 3 篇 地质学
    • 3 篇 统计学(可授理学、...
  • 29 篇 经济学
    • 17 篇 应用经济学
    • 13 篇 理论经济学
  • 4 篇 医学
  • 4 篇 军事学
  • 2 篇 农学
  • 1 篇 法学
  • 1 篇 教育学

主题

  • 289 篇 branch and bound...
  • 15 篇 scheduling
  • 10 篇 optimization
  • 10 篇 global optimizat...
  • 10 篇 genetic algorith...
  • 9 篇 mixed integer li...
  • 8 篇 feature selectio...
  • 7 篇 linear programmi...
  • 7 篇 integer programm...
  • 6 篇 petri net
  • 6 篇 cyclic schedulin...
  • 6 篇 branch and bound...
  • 6 篇 portfolio optimi...
  • 5 篇 dimensionality r...
  • 5 篇 combinatorial op...
  • 5 篇 dynamic programm...
  • 5 篇 nonlinear progra...
  • 5 篇 greedy algorithm
  • 4 篇 structural optim...
  • 4 篇 no-wait

机构

  • 5 篇 middle e tech un...
  • 4 篇 korea adv inst s...
  • 4 篇 northwestern pol...
  • 4 篇 carnegie mellon ...
  • 3 篇 northeastern uni...
  • 3 篇 chung yuan chris...
  • 3 篇 beijing jiaotong...
  • 2 篇 indian inst tech...
  • 2 篇 univ elect sci &...
  • 2 篇 chinese univ hon...
  • 2 篇 korea adv inst s...
  • 2 篇 northwestern uni...
  • 2 篇 university of ca...
  • 2 篇 department of in...
  • 2 篇 ain shams univ f...
  • 2 篇 sichuan univ col...
  • 2 篇 wayne state univ...
  • 2 篇 vnit nagpur dept...
  • 2 篇 iit kharagpur de...
  • 2 篇 southeast univ n...

作者

  • 9 篇 azizoglu meral
  • 7 篇 nakariyakul song...
  • 6 篇 yan pengyu
  • 6 篇 kim hyun-jung
  • 5 篇 konno h
  • 5 篇 che ada
  • 4 篇 chu chengbin
  • 4 篇 rostami mohammad
  • 4 篇 lee jun-ho
  • 4 篇 bahig hatem m.
  • 4 篇 yang naiding
  • 4 篇 lee tae-eog
  • 4 篇 kim yeong-dae
  • 3 篇 haftka rt
  • 3 篇 casasent david p...
  • 3 篇 mishra sabyasach...
  • 2 篇 ng wc
  • 2 篇 telemeci yasin e...
  • 2 篇 cai xiaoqiang
  • 2 篇 shim sang-oh

语言

  • 255 篇 英文
  • 31 篇 其他
  • 3 篇 中文
检索条件"主题词=Branch and Bound algorithm"
289 条 记 录,以下是31-40 订阅
排序:
A branch and bound algorithm for minimizing mean flow time on a single batch processing machine
收藏 引用
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-APPLICATIONS AND PRACTICE 1997年 第3期4卷 197-203页
作者: DuPont, L Ghazvini, FJ INPG ENSGI 38031 Grenoble Cedex 46 Avenue Félix Viallet France
We consider the problem of minimizing the mean flow time on a single-batch processing machine. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the proce... 详细信息
来源: 评论
A branch and bound algorithm for solving mean-risk-skewness portfolio models
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 1998年 第2期10卷 297-317页
作者: Konno, H Suzuki, T Kobayashi, D Tokyo Inst Technol Dept Ind Engn & Management Meguro Ku Tokyo 1528552 Japan
This paper discusses an efficient algorithm for solving the mean-absolute deviation-skewness (MADS) portfolio optimization model in which the third order moment in addition to the first and second moment of the rate o... 详细信息
来源: 评论
INFORMATION EXTRACTION ON EFFICIENT PURIFICATION OF ORGANIC-REAGENTS BY USING THE branch-AND-bound algorithm
收藏 引用
ANALYTICA CHIMICA ACTA 1993年 第1期280卷 173-177页
作者: ZENG, W TU, MH LI, K TONG, SY [a]Department of Chemistry Beijing University Beijing 100871 China
Mixtures with a known range of possibly present species can be simultaneously analysed qualitatively and quantitatively by using the branch and bound algorithm. The computation time is much less than in the enumeratio... 详细信息
来源: 评论
A branch and bound algorithm for Solving Mean-risk-skewness Portfolio Models
收藏 引用
Optimization Methods and Software 1999年 第2期10卷 297-317页
作者: Konno, Hiroshi Suzuki, Takayuki Kobayashi, Daisuke Dept. of Indust. Eng. and Management Tokyo Institute of Technology Oh-Okayama Meguro-ku Tokyo 152-8552 Japan
This paper discusses an efficient algorithm for solving the mean-absolute deviation-skewness (MADS) portfolio optimization model in which the third order moment in addition to the first and second moment of the rate o... 详细信息
来源: 评论
QUALITATIVE AND QUANTITATIVE-ANALYSES OF SYNTHETIC PIGMENTS IN FOODS BY USING THE branch-AND-bound algorithm
收藏 引用
ANALYTICA CHIMICA ACTA 1993年 第2期284卷 445-451页
作者: ZENG, W WANG, P ZHANG, HZ TONG, SY [a]Department of Chemistry Peking University Beijing 100871 China
Synthetic pigments in food can be simultaneously analysed qualitatively and quantitatively by using a spectrophotometric method combined with the branch and bound algorithm. This method does not require a preseparatio... 详细信息
来源: 评论
Optimality Condition and branch and bound algorithm for Constrained Redundancy Optimization in Series Systems
收藏 引用
OPTIMIZATION AND ENGINEERING 2002年 第1期3卷 53-65页
作者: Sun, Xiaoling Li, Duan Chinese Univ Hong Kong Dept Syst Engn & Engn Management Shatin Hong Kong Peoples R China Shanghai Univ Dept Math Shanghai 200436 Peoples R China
This paper considers the constrained redundancy optimization problem in series systems. This problem can be formulated as a nonlinear integer programming problem of maximizing the overall systems reliability under lim... 详细信息
来源: 评论
GRAPHICAL SYMBOL RETRIEVAL USING A branch and bound algorithm
GRAPHICAL SYMBOL RETRIEVAL USING A BRANCH AND BOUND ALGORITH...
收藏 引用
IEEE International Conference on Image Processing
作者: Nayef, Nibal Breuel, Thomas M. Tech Univ Kaiserslautern Kaiserslautern Germany
Graphical symbol spotting and retrieval in document images is an important sub-field in document analysis. This paper presents a branch and bound algorithm for spotting a queried graphical symbol in documents. The tec... 详细信息
来源: 评论
Motion Planning of Unicycle-Like Robot using Single RRT with branch and bound algorithm
Motion Planning of Unicycle-Like Robot using Single RRT with...
收藏 引用
10th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)
作者: Yan, Rui-Jun Wu, Jing Lee, Ji-Yeong Hanyang Univ Dept Robot Engn Ansan 426791 South Korea Hanyang Univ Dept Mechatron Engn Ansan 426791 South Korea
This paper presents the motion planning of unicycle-like robot using single Rapidly-exploring Random Tree (RRT) algorithm, combining with branch and bound (BB) method. RRT can construct the searching tree efficiently ... 详细信息
来源: 评论
A Modified branch and bound algorithm to Solve the Transmission Expansion Planning Problem
A Modified Branch and Bound Algorithm to Solve the Transmiss...
收藏 引用
13th International Conference on Environment and Electrical Engineering (EEEIC)
作者: Delgado, M. A. J. Pourakbari-Kasmaei, M. Rider, M. J. UNESP Dept Elect & Elect Engn Ilha Solteira Brazil
In this paper a novel branch and bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the opt... 详细信息
来源: 评论
A branch and bound algorithm for the maximum clique problem
收藏 引用
ZOR Zeitschrift für Operations Research Methods and Models of Operations Research 1990年 第3期34卷 207-217页
作者: Babel, L. Tinhofer, G. Institut für Mathematik Technische Universität München München 2 8000 Arcisstraße 21 Germany
We present a branch and bound algorithm for the maximum clique problem in arbitrary graphs. The main part of the algorithm consists in the determination of upper bounds by graph colorings. Using a modification of a kn... 详细信息
来源: 评论