Results 21 to 30 of about 204,066 (330)
A general branch-and-bound framework for continuous global multiobjective optimization
Journal of Global Optimization, 2021 Current generalizations of the central ideas of single-objective branch-and-bound to the multiobjective setting do not seem to follow their train of thought all the way. The present paper complements the various suggestions for generalizations of partial
Gabriele Eichfelder +3 more
semanticscholar +1 more source
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm [PDF]
Integration of AI and OR Techniques in Constraint Programming, 2020 Mixed integer linear programs are commonly solved by Branch and Bound algorithms. A key factor of the efficiency of the most successful commercial solvers is their fine-tuned heuristics.
Marc Etheve +4 more
semanticscholar +1 more source
Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment [PDF]
Компьютерные исследования и моделирование, 2015 The paper presents an implementation of branch and bound algorithm employing coarse grained parallelism. The system is based on CBC (COIN-OR branch and cut) open-source MIP solver and inter-process communication capabilities of Erlang.
S. A. Smirnov, V. V. Voloshinov
doaj +1 more source
Tool for Simulating Branch and Bound Computations
Open Computer Science, 2020 The paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered.
Ignatov Andrei, Gorchakov Andrei
doaj +1 more source
Learning Optimal Decision Trees Using Caching Branch-and-Bound Search
AAAI Conference on Artificial Intelligence, 2020 Several recent publications have studied the use of Mixed Integer Programming (MIP) for finding an optimal decision tree, that is, the best decision tree under formal requirements on accuracy, fairness or interpretability of the predictive model.
Gaël Aglin, S. Nijssen, P. Schaus
semanticscholar +1 more source
Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri, 2020 GNP Snack company has problems in making raw material inventories which are sometimes not enough for 0.5 tons of cassava chips to fulfill demand. This will affect the production process carried out every day.
Sarif Hasan, Yohanes Anton Nugroho
doaj +1 more source
A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers
Mathematics, 2022 In the game industry, tardiness is an important issue. Unlike a unifunctional machine, a developer may excel in programming but be mediocre in scene modeling. His/her processing speed varies with job type. To minimize tardiness, we need to schedule these
Chung-Ho Su, Jen-Ya Wang
doaj +1 more source
European Journal of Operational Research, 2020 In this work we propose an efficient branch-and-bound (B&B) algorithm for the permutation flow-shop problem (PFSP) with makespan objective. We present a new node decomposition scheme that combines dynamic branching and lower bound refinement strategies ...
Jan Gmys +3 more
semanticscholar +1 more source
Improved branch and bound method for control structure screening [PDF]
, 2005 The main aim of this paper is to present an improved algorithm of “Branch and Bound” method for control structure screening. The new algorithm uses a best- first search approach, which is more efficient than other algorithms based on depth-first search ...
Cao, Yi, Saha, Prabirkumar
core +1 more source
The temolate for parallel branch algorithm
Lietuvos Matematikos Rinkinys, 2004 The aim of this work is to propose parallel branch and bound algorithm template. For this purpose sequential template is introduced. Implementing additional features of this template some parallel branch and bound algorithms are comstructed and analyzed
Milda Baravykaitė
doaj +3 more sources