Results 1 to 10 of about 1,083 (68)
Tool for Simulating Branch and Bound Computations
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
Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment [PDF]
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
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
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
The temolate for parallel branch algorithm
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
Introducing an Educational Tool for Learning Branch & Bound Strategy
—According to our informal survey, Branch & Bound strategy is considerably difficult to learn compared to other strategies. This strategy consists of several complex algorithmic steps such as Reduced Cost Matrix (RCM) calculation and Breadth First Search.
Sofriesilero Zumaytis, Oscar Karnalim
doaj +1 more source
Many problems in economy may be formulated as global optimization problems. Most numerically promising methods for solution of multivariate unconstrained Lipschitz optimization problems of dimension greater than 2 use rectangular or simplicial branch‐and‐
Remigijus Paulavičius +1 more
doaj +1 more source
An implementation of a parallel generalized branch and bound template
Branch and bound (BnB) is a general algorithm to solve optimization problems. We present a template implementation of the BnB paradigm. A BnB template is implemented using C++ object oriented paradigm. MPI is used for underlying communications.
Milda Baravykaitė, Raimondas Čiegis
doaj +1 more source
NEW VERSION OF THE BBS METHOD AND ITS USAGE FOR DETERMINING AND SCHEDULING VEHICLE ROUTES [PDF]
The work presents a method of the vehicle routing and scheduling using the modified Branch and Bound Simulation method for vehicles simultaneously carrying loads from multiple orders.
Andrzej Wolfenburg
doaj +1 more source
The purpose of this study was to optimize the distribution route of commercial rice for general logistics companies in Kendari City using the branch and bound method with the help of lingo software.
Dhian Herdhiansyah +3 more
doaj +1 more source

