Results 291 to 300 of about 244,573 (375)
Some of the next articles are maybe not open access.
A Branch and Bound Clustering Algorithm
IEEE Transactions on Computers, 1975The problem of clustering N objects into M classes may be viewed as a combinatorial optimization algorithm. In the literature on clustering, iterative hill-climbing techniques are used to find a locally optimum classification. In this paper, we develop a clustering algorithm based on the branch and bound method of combinatorial optimization.
Koontz, Warren L. G. +2 more
openaire +4 more sources
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers, 1975K. Fukunaga, P. Narendra
semanticscholar +3 more sources
An anytime branch and bound algorithm for agile earth observation satellite onboard scheduling
Advances in Space Research, 2017Xiaogeng Chu, Yuning Chen, Yuejin Tan
semanticscholar +3 more sources
IEEE Transactions on Automation Science and Engineering, 2021
This work investigates a scheduling problem of deadlock-prone flexible manufacturing systems modeled by place-timed Petri nets. It proposes an anytime branch and bound (AB&B) algorithm for it to minimize system makespan based on the branch tree of a net ...
Jianchao Luo +2 more
semanticscholar +1 more source
This work investigates a scheduling problem of deadlock-prone flexible manufacturing systems modeled by place-timed Petri nets. It proposes an anytime branch and bound (AB&B) algorithm for it to minimize system makespan based on the branch tree of a net ...
Jianchao Luo +2 more
semanticscholar +1 more source
A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems
Computers and Industrial Engineering, 2016A. Kadri, I. Kacem, K. Labadi
semanticscholar +3 more sources
Swarm and Evolutionary Computation, 2020
This work presents a novel parallel branch and bound algorithm to efficiently solve to optimality a set of instances of the multi-objective flexible job shop scheduling problem for the first time, to the very best of our knowledge.
Carlos Soto +6 more
semanticscholar +1 more source
This work presents a novel parallel branch and bound algorithm to efficiently solve to optimality a set of instances of the multi-objective flexible job shop scheduling problem for the first time, to the very best of our knowledge.
Carlos Soto +6 more
semanticscholar +1 more source
An enhanced branch-and-bound algorithm for bilevel integer linear programming
European Journal of Operational Research, 2020Bilevel integer linear programming (BILP) problems have been studied for decades. Many exact algorithms have been proposed in recent years for small- or medium-sized instances.
Shaonan Liu +3 more
semanticscholar +1 more source
Parallel branch-and-bound algorithms
Future Generation Computer Systems, 1989Abstract In this paper a parallel algorithm for branch-and-bound problems is sketched. It is designed to run on MIMD machines and exploits coarse grain parallelism. Due to the irregular and unpredictable behavior of branch-and-bound algorithms, it is hard to obtain a good load-balance.
J.M. Jansen, F.W. Sijstermans
openaire +1 more source
Embedding Branch and Bound within Evolutionary Algorithms
Applied Intelligence, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cotta, Carlos, Troya, José M.
openaire +2 more sources
International Journal of Management Science and Engineering Management, 2020
This paper addresses a two-machine no-wait flowshop problem with the effect of the truncated learning function of jobs whose actual processing times depend on their positions in the sequence.
V. Azizi, Guiping Hu
semanticscholar +1 more source
This paper addresses a two-machine no-wait flowshop problem with the effect of the truncated learning function of jobs whose actual processing times depend on their positions in the sequence.
V. Azizi, Guiping Hu
semanticscholar +1 more source