咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
COMBINATORIAL algorithms FOR DNA-SEQUENCE ASSEMBLY
收藏 引用
ALGORITHMICA 1995年 第1-2期13卷 7-51页
作者: KECECIOGLU, JD MYERS, EW UNIV ARIZONA DEPT COMP SCI TUCSON AZ 85721 USA
The trend toward very large DNA sequencing projects, such as those being undertaken as part of the Human Genome Program, necessitates the development of efficient and precise algorithms for assembling a long DNA seque... 详细信息
来源: 评论
Some applications of a polynomial inequality to global optimization
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2005年 第1期127卷 193-205页
作者: Zhang, JF Kwong, CP Chinese Univ Hong Kong Dept Automat & Comp Aided Engn Shatin Hong Kong Peoples R China
In this paper, we use the Ehlich-Zeller-Gartel inequality to derive an algorithm for finding the global minima of polynomials over hyperrectangles as well as to provide a bounding method for the branch-and-bound algor... 详细信息
来源: 评论
EXACT AND APPROXIMATION algorithms FOR SORTING BY REVERSALS, WITH APPLICATION TO GENOME REARRANGEMENT
收藏 引用
ALGORITHMICA 1995年 第1-2期13卷 180-210页
作者: KECECIOGLU, J SANKOFF, D UNIV MONTREAL CTR RECH MATHMONTREAL H3C 3J7PQCANADA
Motivated by the problem in computational biology of reconstructing the series of chromosome inversions by which one organism evolved from another, we consider the problem of computing the shortest series of reversals... 详细信息
来源: 评论
The multidimensional 0-1 knapsack problem:: An overview
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2004年 第1期155卷 1-21页
作者: Fréville, A Univ Valenciennes & Hainaut Cambresis Grp Rech Operat & Informat CNRS Lab Automat Mecan & Informat Ind & HumainesUMR 8 F-59313 Valenciennes France
The multidimensional 0-1 knapsack problem is one of the most well-known integer programming problems and has received wide attention from the operational research community during the last four decades. Although recen... 详细信息
来源: 评论
Discovering cis-regulatory modules by optimizing barbecues
收藏 引用
DISCRETE APPLIED MATHEMATICS 2009年 第10期157卷 2458-2468页
作者: Mosig, Axel Biyikoglu, Tuerker Prohaska, Sonja J. Stadler, Peter F. Shanghai Inst Biol Sci CAS MPG Partner Inst Computat Biol Shanghai 200031 Peoples R China Max Planck Inst Math Sci D-04103 Leipzig Germany Isik Univ TR-34980 Istanbul Turkey Univ Vienna Dept Theoret Chem A-1090 Vienna Austria Univ Leipzig Bioinformat Grp Dept Comp Sci D-04107 Leipzig Germany Univ Leipzig Interdisciplinary Ctr Bioinformat D-04107 Leipzig Germany Santa Fe Inst Santa Fe NM 87501 USA Arizona State Univ Dept Biomed Informat Sch Comp & Informat Tempe AZ 85287 USA Fraunhofer Inst Zelltherapie & Immunol D-04103 Leipzig Germany
Gene expression in eukaryotic cells is regulated by a complex network of interactions, in which transcription factors and their binding sites on the genomic DNA play a determining role. As transcription factors rarely... 详细信息
来源: 评论
Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2007年 第4期34卷 954-965页
作者: Cook, Wade D. Golany, Boaz Penn, Michal Raviv, Tal York Univ Schulich Sch Buiness N York ON M3J 1P3 Canada Technion Israel Inst Technol Fac Ind Engn & Management IL-32000 Haifa Israel Univ British Columbia Sauder Sch Buiness Vancouver BC V6T 1Z2 Canada
Peer review of research proposals and articles is an essential element in R&D processes worldwide. In most cases, each reviewer evaluates a small subset of the candidate proposals. The review board is then faced w... 详细信息
来源: 评论
Heuristic rejection in interval global optimization
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2003年 第1期118卷 27-43页
作者: Casado, LG García, I Csendes, T Ruíz, VG Univ Almeria Dept Computer Architecture & Elect Almeria Spain Univ Szeged Inst Informat Szeged Hungary
Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization probl... 详细信息
来源: 评论
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2010年 第2期59卷 272-279页
作者: Okolowski, Dariusz Gawiejnowicz, Stanislaw Adam Mickiewicz Univ Poznan Fac Math & Comp Sci PL-61614 Poznan Poland
We consider a parallel-machine scheduling problem with a learning effect and the makespan objective. The impact of the learning effect on job processing times is modelled by the general DeJong's learning curve. Fo... 详细信息
来源: 评论
USING CONVEX ENVELOPES TO SOLVE THE INTERACTIVE FIXED-CHARGE LINEAR-PROGRAMMING PROBLEM
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1988年 第2期59卷 223-246页
作者: BENSON, HP ERENGUC, SS 1.Department of Decision and Information Sciences College of Business Administration University of Florida Gainesville Florida
In the well-known fixed-charge linear programming problem, it is assumed, for each activity, that the value of the fixed charge incurred when the level of the activity is positive does not depend upon which other acti... 详细信息
来源: 评论
RANGI: A Fast List-Colored Graph Motif Finding Algorithm
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2013年 第2期10卷 504-513页
作者: Rudi, Ali Gholami Shahrivari, Saeed Jalili, Saeed Kashani, Zahra Razaghi Moghadam Tarbiat Modares Univ Fac Elect & Comp Engn Tehran Iran
Given a multiset of colors as the query and a list-colored graph, i.e., an undirected graph with a set of colors assigned to each of its vertices, in the NP-hard list-colored graph motif problem the goal is to find th... 详细信息
来源: 评论