Results 61 to 70 of about 35,838 (299)
An Improved Branch and Bound Algorithm for Location-routing Problems
, 2009 An important limitation of the fixed charge location model,is the assumption that full truckload quantities are shipped from a facility to a customer.
Jin L(金莉) +5 more
core +1 more source
Advanced Engineering Materials, EarlyView.Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming
Journal of Applied Mathematics, 2013 A simplicial branch and bound duality-bounds algorithm is presented to globally solving the linear multiplicative programming (LMP). We firstly convert the problem (LMP) into an equivalent programming one by introducing p auxiliary variables.
Xue-Gang Zhou, Bing-Yuan Cao
doaj +1 more source
Advanced Engineering Materials, EarlyView.CT‐based finite element simulations combined with in situ X‐ray computed tomography are used to analyze insert pull‐out in nickel‐coated polymer foams. Despite variations in material parameters, deformation consistently concentrates within a narrow annular region around the insert.
Yannik Bautz +4 more
wiley +1 more source
Advanced Functional Materials, EarlyView.The physical realization of artificial neurons is a critical challenge for energy‐efficient neuromorphic computing. This review presents a comprehensive analysis of the evolution of artificial neuron implementations from conventional CMOS to emerging post‐CMOS technologies.
Kannan Udaya Mohanan +4 more
wiley +1 more source
Advanced Functional Materials, EarlyView.The analysis of optical eigenmodes in chiral liquid crystal with perpendicular or tilted helical axis, and their correspondence with the external medium, leads to an intuitive understanding of the angle and wavelength dependency of transmissive and reflective diffraction.
Ke Xu +5 more
wiley +1 more source
DESIGN AND EXAMINATION OF ALGORITHMS FOR SOLVING THE KNAPSACK PROBLEM [PDF]
Avtomobilʹnyj Transport (Harʹkov), 2015 The use of methods of branches and boundaries as well as the methods of dynamic programming at solving the problem of «knapsack» is grounded. The main concepts are expounded.
S. Kantsedal, M. Kostikova, I. Skrypina
doaj
ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
Journal of the Operations Research Society of Japan, 1977 The behavior of the number of partial problems T(A) which are decomposed in a branch and-bound algorithm A (T(A) may be taken as a measure for the computational efficiency of A) is investigated in a fairly general setting. The first result is that the mean number f(n) of T(A) when A is applied to problems of size n grows at least as fast as ...
openaire +2 more sources
Advanced Functional Materials, EarlyView.Autonomous scanning probe microscopy and multi‐objective Bayesian optimization navigate a ternary (Al,Sc,B)N combinatorial library. Registered photoluminescence, electron‐probe compositional mapping, and X‐ray diffraction connect local electromechanical function to defect‐sensitive emission, composition, and crystal structure.
Yu Liu +12 more
wiley +1 more source
Branch-and-bound algorithm to minimize the total completion time on two dedicated processors
Operations Research PerspectivesIn this paper, we propose an exact method for solving the problem of scheduling multiprocessor tasks on two dedicated processors with release dates. In this problem, we have three subsets of tasks, where these tasks need one or two dedicated processors ...
Adel Kacem, Abdelaziz Dammak
doaj +1 more source