Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function. [PDF]
Front Robot AI, 2022 Champagne Gareau J +2 more
europepmc +1 more source
Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing [PDF]
, 2018 The two-sided assembly-line balancing (2SALB) is widely used in various production systems especially in high-volume large-size products. However, not many types of research are focused on the study of the 2SALB problem.
Elteriki, Salem Abdulsalam
core
Numerical Exploration of Thermal Shock Resistance in MgO–C Refractories
Advanced Engineering Materials, EarlyView.A mesostructure‐resolved numerical framework is developed to evaluate the thermal shock resistance of MgO–C refractories. By modeling interface debonding under rapid temperature changes and introducing a modified thermal shock parameter that accounts for mesocracks, the study shows how graphite content and aggregate size influence thermal shock ...
Jishnu Vinayak Gopi +3 more
wiley +1 more source
Upper bounds of differential branch number of $$n$$ n -bit permutations
CybersecurityThe differential branch number is a key parameter used to measure the diffusion ability of a permutation. It is of great significance to study the upper bound of the differential branch number of permutations. This paper analyses the existence problem of
Ying Gao, Lin Qi
doaj +1 more source
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
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
PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science
Advanced Engineering Materials, EarlyView.Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley +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
Advanced Functional Materials, EarlyView.Shellac, a centuries‐old natural resin, is reimagined as a green material for flexible electronics. When combined with silver nanowires, shellac films deliver transparency, conductivity, and stability against humidity. These results position shellac as a sustainable alternative to synthetic polymers for transparent conductors in next‐generation ...
Rahaf Nafez Hussein +4 more
wiley +1 more source