BRANCH-AND-BOUND

作品数:20被引量:22H指数:3
导出分析报告
相关作者:马林黄伟国黎健玲王鹏更多>>
相关机构:广西大学湖南科技学院更多>>
相关期刊:《Acta Mathematica Scientia》《Chinese Journal of Electronics》《Chinese Quarterly Journal of Mathematics》《Journal of the Operations Research Society of China》更多>>
相关基金:国家自然科学基金国家重点基础研究发展计划湖南科技学院科学研究项目更多>>
-

检索结果分析

结果分析中...
条 记 录,以下是1-10
视图:
排序:
Simulation Optimization for Inpatient Bed Allocation with Sharing
《Journal of Systems Science and Systems Engineering》2025年第1期55-77,共23页Jie Li Sichen Li Jun Luo Haihui Shen 
supported in part by the National Natural Science Foundation of China under Grant Nos.72031006,72031007,and 72394375.
The inpatient bed allocation that allows beds shared among different departments is an important and challenging problem for a healthcare system. When the objective function(s) and (some) constraints need to be estima...
关键词:Healthcare management resource sharing bed allocation simulation optimization empirical stochastic branch-and-bound(ESB&B) 
Learning to Branch in Combinatorial Optimization With Graph Pointer Networks
《IEEE/CAA Journal of Automatica Sinica》2024年第1期157-169,共13页Rui Wang Zhiming Zhou Kaiwen Li Tao Zhang Ling Wang Xin Xu Xiangke Liao 
supported by the Open Project of Xiangjiang Laboratory (22XJ02003);Scientific Project of the National University of Defense Technology (NUDT)(ZK21-07, 23-ZZCX-JDZ-28);the National Science Fund for Outstanding Young Scholars (62122093);the National Natural Science Foundation of China (72071205)。
Traditional expert-designed branching rules in branch-and-bound(B&B) are static, often failing to adapt to diverse and evolving problem instances. Crafting these rules is labor-intensive, and may not scale well with c...
关键词:Branch-and-bound(B&B) combinatorial optimization deep learning graph neural network imitation learning 
Parallel Bounded Search for the Maximum Clique Problem
《Journal of Computer Science & Technology》2023年第5期1187-1202,共16页江华 白珂 刘海姣 李初民 Felip Manya 付樟华 
supported by the National Natural Science Foundation of China under Grant No.62162066;the Open Funding of Engineering Research Center of Cyberspace of Ministry of Education of China under Grant No.WLKJAQ202011010;the Education Department Funding of Yunnan Province of China under Grant No.2021J0006;the Spanish AEI project PID2019-111544GB-C2.
Given an undirected graph,the Maximum Clique Problem(MCP)is to find a largest complete subgraph of the graph.MCP is NP-hard and has found many practical applications.In this paper,we propose a parallel Branch-and-Boun...
关键词:Branch-and-Bound(BnB) maximum clique problem(MCP) parallel search 
Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming被引量:2
《Journal of the Operations Research Society of China》2023年第3期569-594,共26页Hong-Wei Jiao You-Lin Shang 
the National Natural Science Foundation of China(Nos.11871196,12071133 and 12071112);the China Postdoctoral Science Foundation(No.2017M622340);the Key Scientific and Technological Research Projects of Henan Province(Nos.202102210147 and 192102210114);the Science and Technology Climbing Program of Henan Institute of Science and Technology(No.2018JY01).
This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by util...
关键词:Generalized linear fractional programming Global optimization Two-level linear relaxation method BRANCH-AND-BOUND 
Analytics of an Imperfect Four-Layer Production Inventory Model Under Two-Level Credit Period Using Branch-and-Bound Technique
《Journal of the Operations Research Society of China》2022年第4期725-748,共24页Subrata Panja Shyamal Kumar Mondal 
This research work was supported by Council of Scientific and Industrial Research,Human Resource Development Group,India(No.25(0276)/17/EMR-II).
This paper explains an integrated production inventory supply chain model,which consists of a supplier,a manufacturer and a retailer under two-level credit period.One is manufacturer’s credit period offered by the su...
关键词:Supply chain Integrated production inventory Four-layer inventory system Imperfect production Two-level credit period 
Accelerated solution of the transmission maintenance schedule problem:a Bayesian optimization approach被引量:4
《Global Energy Interconnection》2021年第5期493-500,共8页Jingcheng Mei Guojiang Zhang Donglian Qi Jianliang Zhang 
supported by the National Key Research and Development Program of China(Basic Research Class)(No.2017YFB0903000);the National Natural Science Foundation of China(No.U1909201).
To maximize the maintenance willingness of the owner of transmission lines,this study presents a transmission maintenance scheduling model that considers the energy constraints of the power system and the security con...
关键词:Transmission maintenance scheduling Mixed integer programming(MIP) Machine learning Bayesian optimization(BO) BRANCH-AND-BOUND 
A nonlinear service composition method based on the Skyline operator
《Journal of Systems Engineering and Electronics》2020年第4期743-750,共8页HUO Ying ZHANG Jiande 
supported by the National Natural Science Foundation for Youth of China(61802174);the Natural Science Foundation for Youth of Jiangsu Province(BK20181016);the Natural Science Foundation of the Jiangsu Higher Education Institutions of China(18KJB520019);the Scientific Research Foundation of Nanjing Institute of Technology of China(CXY201922)。
The concept of service composition can provide the complex functionality for users. As the widespread application of cloud computing, the number of services grows exponentially. It becomes more difficult to find out t...
关键词:quality of service service composition Skyline service branch-and-bound Skyline 
Constrained maximum weighted bipartite matching:a novel approach to radio broadcast scheduling被引量:1
《Science China(Information Sciences)》2019年第7期156-169,共14页Shaojiang WANG Tianyong WU Yuan YAO Dongbo BU Shaowei CAI 
supported by National Natural Science Foundation of China (Grant No. 61772503);National Basic Research Program of China (Grant No. 2014CB340302)
Given a set of radio broadcast programs, the radio broadcast scheduling problem is to allocate a set of devices to transmit the programs to achieve the optimal sound quality. In this article, we propose a complete alg...
关键词:RADIO broadcast scheduling BRANCH-AND-BOUND ALGORITHM CONSTRAINED MAXIMUM WEIGHTED bipartite matching Kuhn-Munkres ALGORITHM strategy combinations 
反向Top-k查询算法研究
《软件导刊》2017年第9期75-78,共4页黄伟国 
湖南科技学院科学研究项目(110391150)
互联网中沉淀了大量可分析利用的数据,如何有效地利用这些海量数据,为不同行业产品制造方提供对新产品的分析,已成为时下的热点。反向Top-k查询技术是一种常用的数据分析及处理技术,并且已经在很多领域得到了应用。研究了已有的基于反向...
关键词:交互式算法 Skyband-based算法 Branch-and-Bound算法 TOP-K查询 
Structural System Reliability Assessment and Updating Using Chain-Structure BNs
《建筑工程(中英文版)》2015年第3期36-43,共8页Qi’ang Wang Ziyan Wu Zongming Cai 
An efficient computational framework for structural system reliability analysis and Updating based on Chain-Structure Bayesian networks(BNs)is present in the paper.The framework combines BNs and structural reliability...
关键词:System Reliability Chain-Structure BNs Improved BRANCH-AND-BOUND Method Failure Path EVENTS PNET 
检索报告 对象比较 聚类工具 使用帮助 返回顶部