Results 21 to 30 of about 915,013 (232)
Introducing an Educational Tool for Learning Branch & Bound Strategy
Journal of Information Systems Engineering and Business Intelligence, 2017 —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
Optimal Scheduling Using Branch and Bound with SPIN 4.0 [PDF]
, 2003 The use of model checkers to solve discrete optimisation problems is appealing. A model checker can first be used to verify that the model of the problem is correct.
A. Fehnker +15 more
core +5 more sources
Technological and Economic Development of Economy, 2009 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
Mathematical Modelling and Analysis, 2007 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]
Archives of Transport, 2014 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
Agrointek, 2023 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
Heuristics for Longest Edge Selection in Simplicial Branch and Bound [PDF]
, 2015 Pre-print de la comunicacion presentada al ICCSA2015Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re nement process, a popular strategy is to divide simplices by their longest edge, thus avoiding ...
Casado, Leocadio G. +3 more
core +1 more source
Branch and bound method for regression-based controlled variable selection [PDF]
, 2013 Self-optimizing control is a promising method for selection of controlled variables (CVs) from available measurements. Recently, Ye, Cao, Li, and Song (2012) have proposed a globally optimal method for selection of self-optimizing CVs by converting the ...
Cao, Yi, Kariwala, Vinay, Ye, Lingjian
core +1 more source
Algoritma Penentuan Ukuran Batch Integer pada Penjadwalan Flowshop Satu Mesin
Jurnal Optimasi Sistem Industri, 2016 Scheduling is an important area of production planning and control. Scheduling is required to produce an existing job by allocating existing resources in the proper execution order.
Hadigufri Triha +3 more
doaj +1 more source
Mathematics, 2023 The performance of branch-and-bound algorithms for solving non-convex optimization problems greatly depends on convex relaxation techniques. They generate convex regions which are used for improving the bounds of variable domains.
Victor Reyes, Ignacio Araya
doaj +1 more source