Results 81 to 90 of about 915,013 (232)
Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm. [PDF]
Front Pharmacol, 2022 Kusuma WA +6 more
europepmc +1 more source
Influence of Lipschitz bounds on the speed of global optimization
Technological and Economic Development of Economy, 2012 Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve various optimization problems. In this paper a bound for Lipschitz function is proposed, which is computed using function values at the vertices of a ...
Remigijus Paulavičius +1 more
doaj +1 more source
Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan
PROZIMA (Productivity Optimization and Manufacturing System Engineering), 2019 This article discussed the problem of flow shop scheduling to minimize the makespan. The purpose of this article is to develop the LPT and Branch And Bound (LPT-Branch And Bound) algorithms to minimize the makespan.
Dana Marsetiya Utama
semanticscholar +1 more source
Branch and peg algorithms for the simple plant location problem [PDF]
The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost.
Ghosh, Diptesh +2 more
core +1 more source
BarekengA method commonly employed to solve integer programming problems is the Branch and Bound. In this article, maximizing the number of matches held on the first day of pencak silat tournaments is essential because it can impact the overall dynamics and ...
Aditya Ambarwati +2 more
doaj +1 more source
Single Machine Problem with Multi-Rate-Modifying Activities under a Time-Dependent Deterioration
Journal of Applied Mathematics, 2013 The single machine scheduling problem with multi-rate-modifying activities under a time-dependent deterioration to minimize makespan is studied. After examining the characteristics of the problem, a number of properties and a lower bound are proposed.
M. Huang +5 more
doaj +1 more source
A Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling
, 2017 The agile earth observing satellite scheduling (AEOSS) problem consists of scheduling a subset of images among a set of candidates that satisfy imperative constraints and maximize a gain function.
Xiaogeng Chu, Yuning Chen, Lining Xing
semanticscholar +1 more source
Energy Efficiency Optimization for Mobile Ad Hoc Networks
IEEE Access, 2016 Tremendous traffic demands for ubiquitous access and emerging multimedia applications significantly increase the energy consumption of battery-powered mobile devices.
Wen-Kuang Kuo, Shu-Hsien Chu
doaj +1 more source
Verification of Backtracking and Branch and Bound Design Templates
Моделирование и анализ информационных систем, 2011 The Design and Analysis of Computer Algorithms is a must of Computer Curricula. It covers many topics that group around several core themes. These themes range from data structures to the complexity theory, but one very special theme is algorithmic ...
N. V. Shilov
doaj
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)Samosir has a wide area and several tourist attractions, making it difficult for visitors to explore the island. Not knowing the route can make the journey less fun and waste time.
Rudy Chandra, Tegar Arifin Prasetyo
doaj +1 more source