Results 31 to 40 of about 224,803 (288)
Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control [PDF]
, 2014 This paper presents a branch-and-lift algorithm for solving optimal control problems with smooth nonlinear dynamics and potentially nonconvex objective and constraint functionals to guaranteed global optimality.
A. Bompadre +71 more
core +1 more source
Operator-level GPU-Accelerated Branch and Bound Algorithms
Procedia Computer Science, 2013 AbstractBranch-and-Bound (B&B) algorithms are well-known tree-based exploratory methods for solving to optimality NP-hard discrete optimization problems. The construction of the B&B tree and its exploration are performed using four operators: branching, bounding, selection and pruning.
Chakroun, Imen, Nouredine, Melab
openaire +2 more sources
Integrated Design of Cellular Production System Using Branch and Bound Algorithm
Discrete Dynamics in Nature and Society, 2022 Most research done on the design of cellular production systems also has examined one of the main areas of design including cell formation, cellular layout, and material handling.
Roohallah Ranjbar +3 more
doaj +1 more source
Computational Protein Design Using AND/OR Branch-and-Bound Search
, 2015 The computation of the global minimum energy conformation (GMEC) is an important and challenging topic in structure-based computational protein design.
Wu, Yuexin, Zeng, Jianyang, Zhou, Yichao
core +1 more source
A Novel Method for the Absolute Pose Problem with Pairwise Constraints
, 2019 Absolute pose estimation is a fundamental problem in computer vision, and it is a typical parameter estimation problem, meaning that efforts to solve it will always suffer from outlier-contaminated data.
Chen, Guang +5 more
core +1 more source
Space-Efficient Parallel Algorithms for Combinatorial Search Problems [PDF]
, 2013 We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an $n$-node tree of height $h$ under the assumption that a node can be accessed ...
C. Kaklamanis +6 more
core +2 more sources
A branch and bound and simulated annealing approach for job shop scheduling [PDF]
, 2004 This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In
Salim, Sutinah, Tan, Hui Woon
core
Advanced Engineering Materials, EarlyView.In this experimental study, the mechanical properties of additively manufactured Ti‐6Al‐4V lattice structures of different geometries are characterized using compression, four point bending and fatigue testing. While TPMS designs show superior fatigue resistance, SplitP and Honeycomb lattice structures combine high stiffness and strength. The resulting
Klaus Burkart +3 more
wiley +1 more source
Quantity decisions of two-stage competitive location model based on different location modes
Complex & Intelligent Systems, 2021 The facility location of a competing firm in a market has great importance in supply chain management. The two-stage competitive location model formulates the decision process of an entrant firm facing both location and price competition.
Yadong Li, Xuemei Li
doaj +1 more source
An Approach for Autonomous Feeding Robot Path Planning in Poultry Smart Farm
Animals, 2022 In order to solve the problems of poor feeding environment, untimely feeding and high labor demand in poultry smart farms, the development of feeding robots is imminent, while the research on path planning algorithms is an important part of developing ...
Yanjun Zhang +5 more
doaj +1 more source