咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是1-10 订阅
排序:
NK-MaxClique and MMCQ: Tow New Exact branch and bound algorithms for the Maximum Clique Problem
收藏 引用
IEEE ACCESS 2020年 8卷 180045-180053页
作者: Mohammadi, Neda Kadivar, Mehdi Shahrekord Univ Dept Comp Sci Shahrekord *** Iran
The maximum clique problem (MCP) is a fundamental problem in combinatorial optimization which finds important applications in real-word. This paper describes two new efficient branch-and-bound maximum clique algorithm... 详细信息
来源: 评论
Enhancing branch-and-bound for Multiobjective 0-1 Programming
收藏 引用
INFORMS JOURNAL ON COMPUTING 2024年 第1期36卷 1-304, C2页
作者: Forget, Nicolas Parragh, Sophie N. Aarhus Univ Sch Business & Social Sci Dept Econ & Business Econ DK-8210 Aarhus 5 Denmark Johannes Kepler Univ Linz Inst Prod & Logist Management A-4040 Linz Austria
In the biobjective branch-and-bound literature, a key ingredient is objective branching, that is, to create smaller and disjoint subproblems in the objective space, obtained from the partial dominance of the lower bou... 详细信息
来源: 评论
GROUPED VARIABLE SELECTION WITH DISCRETE OPTIMIZATION: COMPUTATIONAL AND STATISTICAL PERSPECTIVES
收藏 引用
ANNALS OF STATISTICS 2023年 第1期51卷 1-32页
作者: Hazimeh, Hussein Mazumder, Rahul Radchenko, Peter Google Res Mountain View CA 94043 USA MIT Sloan Sch Management 77 Massachusetts Ave Cambridge MA 02139 USA Univ Sydney Univ Sydney Business Sch Sydney NSW Australia
We present a new algorithmic framework for grouped variable selection that is based on discrete mathematical optimization. While there exist several appealing approaches based on convex relaxations and nonconvex heuri... 详细信息
来源: 评论
A Novel Approach for Subgraph Isomorphism Problem on Bipartite Graphs  27
A Novel Approach for Subgraph Isomorphism Problem on Biparti...
收藏 引用
27th Signal Processing and Communications Applications Conference (SIU)
作者: Koca, Mehmet Burak Sevilgen, Fatih Erdogan Gebze Tekn Univ Bilgisayar Muhendisligi Bolumu Kocaeli Turkey
Subgraph isomorphism problem on specialized graphs is an open research area. Most of the algorithms that had been developed for subgraph isomorphism problem are designed for general graphs. Although, they can be utili... 详细信息
来源: 评论
Multiobjective Nonlinear Sum of Fractional Optimization Problems with Nonconvex Constraints with the Use of the Duality-Based branch and bound Algorithm
收藏 引用
UKRAINIAN MATHEMATICAL JOURNAL 2018年 第11期69卷 1689-1709页
作者: Bhati, D. Singh, P. Motilal Nehru Natl Inst Technol Allahabad Uttar Pradesh India
We study the solution of a multiobjective nonlinear sum of fractional optimization problems. A dualitybased branch and bound cut method is developed for the efficient solution of this problems. The proposed methodolog... 详细信息
来源: 评论
NP-StructurePredictor: Prediction of Unknown Natural Products in Plant Mixtures
收藏 引用
JOURNAL OF CHEMICAL INFORMATION AND MODELING 2017年 第12期57卷 3138-3148页
作者: Harn, Yeu-Chern Su, Bo-Han Ku, Yuan-Ling Lin, Olivia A. Chou, Cheng-Fu Tseng, Y. Jane Natl Taiwan Univ Grad Inst Networking & Multimedia 1 Roosevelt Rd Sect 4 Taipei 10617 Taiwan NTU Ctr Genom Med Metabolom Core Lab 7F2 Syujhou Rd Taipei 10055 Taiwan Natl Taiwan Univ Dept Comp Sci & Informat Engn 1 Roosevelt Rd Sect 4 Taipei 10617 Taiwan Med & Pharmaceut Ind Technol & Dev Ctr 7F9 Wuquan Rd Taipei 24886 Taiwan Natl Taiwan Univ Grad Inst Biomed Elect & Bioinformat 1 Roosevelt Rd Sect 4 Taipei 10617 Taiwan Natl Taiwan Univ Drug Res Ctr Coll Med 1 Jen Ai Rd Sect 1 Taipei 10051 Taiwan
Identification of the individual chemical constituents of a mixture, especially solutions extracted from medicinal plants, is a time-consuming task. The identification results are often limited by challenges such as t... 详细信息
来源: 评论
Experimental verification of efficiency of some composite algorithms
Experimental verification of efficiency of some composite al...
收藏 引用
International Conference on Applied Mathematics & Computational Science
作者: Vitaly O. Groppen Research Institute of Computer Sciences North-Caucsian Mining and Metallurgy Institute
The paper contains experimental analysis of efficiency of a new class of algorithms i.e. composite algorithms aimed at solving of knapsack problem providing global optimal solution. These algorithms combine features o... 详细信息
来源: 评论
Globally optimal beamforming design for downlink CoMP transmission with limited backhaul capacity
Globally optimal beamforming design for downlink CoMP transm...
收藏 引用
IEEE International Conference on Acoustics, Speech and Signal Processing
作者: Kien-Giang Nguyen Quang-Doanh Vu Markku Juntti Le-Nam Tran Centre for Wireless Communications University of Oulu P.O. Box 4500 FI-90014 Finland Department of Electronic Engineering Maynooth University Ireland
This paper considers a multicell downlink channel in which multiple base stations (BSs) cooperatively serve users by jointly precoding shared data transported from a central processor over limited-capacity backhaul li... 详细信息
来源: 评论
Resource Tardiness Weighted Cost Minimization in Project Scheduling (vol 2017, 1308704, 2017)
收藏 引用
ADVANCES IN OPERATIONS RESEARCH 2017年 第1期2017卷 11-11页
作者: Chaleshtari, Ali Shirzadeh Islamic Azad Univ West Tehran Branch Dept Ind Engn Coll Engn Tehran Iran
In this paper, we study a project scheduling problem that is called resource constrained project scheduling problem under minimization of total weighted resource tardiness penalty cost (RCPSP-TWRTPC). In this problem,... 详细信息
来源: 评论
Combinatorial approach for sizing and optimal energy management of HEV including durability constraints  24
Combinatorial approach for sizing and optimal energy managem...
收藏 引用
24th IEEE International Symposium on Industrial Electronics (ISIE)
作者: Chauvin, Alan Hijazi, Alaa Bideaux, Eric Sari, Ali Univ Lyon INSA Lyon Lab Ampere UMR CNRS 5005 F-69621 Villeurbanne France Univ Lyon 1 UMRS CNRS 5005 Lab Ampere F-69622 Lyon France
This paper presents a combinatorial approach used to solve an optimization problem including component sizing and energy management control applied to an offroad hybrid electric vehicle with durability constraints. Th... 详细信息
来源: 评论