咨询与建议

限定检索结果

文献类型

  • 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 篇 工商管理
  • 78 篇 理学
    • 63 篇 数学
    • 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...
  • 5 篇 dimensionality r...
  • 5 篇 portfolio optimi...
  • 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 条 记 录,以下是211-220 订阅
排序:
Late work minimization in a small flexible manufacturing system
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2007年 第2期52卷 210-228页
作者: Sterna, Malgorzata Poznan Univ Tech Inst Comp Sci Piotrowo 2 PL-60965 Poznan Poland
The paper concerns a small flexible manufacturing system consisting of three CNC machines: a lathe machine, milling machine and measurement center and a single robot, located at the Poznan University of Technology. A ... 详细信息
来源: 评论
An algorithm for Scheduling a No-Wait Robotic Production System with Multi-Type Parts
An Algorithm for Scheduling a No-Wait Robotic Production Sys...
收藏 引用
3rd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)
作者: Che Ada Yan Pengyu Yang Naiding Chu Chengbin Northwestern Polytech Univ Sch Management Xian 710072 Peoples R China Univ Technol Troyes Inst Charles Delaunay F-10010 Troyes France
An exact algorithm is proposed to solve a scheduling problem of a robotic production system in which multi-type parts are processed and parts are not allowed to wait on the machines. Finding an optimal schedule in suc... 详细信息
来源: 评论
An improved branch and bound algorithm for feature selection
收藏 引用
PATTERN RECOGNITION LETTERS 2003年 第12期24卷 1925-1933页
作者: Chen, XW Calif State Univ Northridge Dept Elect & Comp Engn Northridge CA 91330 USA
Feature selection plays an important role in pattern classification. In this paper, we present an improved branch and bound algorithm for optimal feature subset selection. This algorithm searches for an optimal soluti... 详细信息
来源: 评论
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2003年 第2期30卷 309-320页
作者: Tozkapan, A Kirca, Ö Chung, CS Cleveland State Univ Dept Operat Management & Business Stat Cleveland OH 44114 USA Middle E Tech Univ Dept Ind Engn TR-06531 Ankara Turkey
In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizing the total weighted flowtime. A lower bounding procedure and a dominance criterion are developed and incorporated in... 详细信息
来源: 评论
Mean-variance portfolio optimal problem under concave transaction cost
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2006年 第1期174卷 1-12页
作者: Xue, HG Xu, CX Feng, ZX Xi An Jiao Tong Univ Fac Sci Sch Econ & Finance Xian 710049 Peoples R China Xi An Jiao Tong Univ Fac Sci Xian 710049 Peoples R China Xi An Jiao Tong Univ JinHe Ctr Econ Res Xian 710049 Peoples R China
In this paper, the classical mean-variance portfolio model is modified for calculating a globally optimal portfolio under concave transaction costs. A non-decreasing concave function is employed to approximate origin ... 详细信息
来源: 评论
Improved generation of minimal addition chains
收藏 引用
COMPUTING 2006年 第2期78卷 161-172页
作者: Bahig, Hatem M. Ain Shams Univ Fac Sci Dept Math Comp Sci Cairo Egypt
An addition chain for a natural number n is a sequence 1 = a(0) < a(1) <. . . a(r) = n of numbers such that for each 0 < i <= r, a(i) = a(j) + a(k) for some 0 <= k <= j < i. An improvement by a fa... 详细信息
来源: 评论
A heuristic rule for relocating blocks
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2006年 第4期33卷 940-954页
作者: Kim, KH Hong, GP Pusan Natl Univ Dept Ind Engn Pusan 609735 South Korea
One of the most important objectives of the storage and pickup operations in block stacking systems is to minimize the number of relocations during the pickup operation. This study suggests two methods for determining... 详细信息
来源: 评论
Lower bound improvement and forcing rule for quadratic binary programming
收藏 引用
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2006年 第2-3期33卷 187-208页
作者: Huang, HX Pardalos, PM Prokopyev, OA Tsing Hua Univ Dept Ind Engn Beijing 100084 Peoples R China Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA
In this paper several equivalent formulations for the quadratic binary programming problem are presented. Based on these formulations we describe four different kinds of strategies for estimating lower bounds of the o... 详细信息
来源: 评论
MACHINE SCHEDULING WITH PREVENTIVE MAINTENANCES
MACHINE SCHEDULING WITH PREVENTIVE MAINTENANCES
收藏 引用
作者: SAKİNE BATUN Middle East Technical University
学位级别:硕士
In manufacturing environments, machines are usually subject to down periods due to various reasons such as preventive maintenance activities, pre- accepted jobs and pre-known material shortages. Among these reasons, p... 详细信息
来源: 评论
A branch and bound algorithm for computing optimal replacement policies in consecutive k-out-of-n-systems
收藏 引用
NAVAL RESEARCH LOGISTICS 2002年 第3期49卷 288-302页
作者: Flynn, J Chung, CS Cleveland State Univ Dept Operat Management & Business Stat Cleveland OH 44115 USA
This paper presents a branch and bound algorithm for computing opt inial replacement policies in a discrete-time, infinite-horizon, dynamic programming model of a binary coherent system with n statistically independen... 详细信息
来源: 评论