Results 81 to 90 of about 35,838 (299)

Grafting a Branch and Bound Method on a Genetic Algorithm for Balancing I / U-Shaped Assembly Lines [PDF]

open access: yesMemoirs of the Scientific Sections of the Romanian Academy, 2011
This paper presents a new efficient hybrid method that combines a branch & bound technique and a genetic algorithm for solving I/U -shaped assembly lines balancing. The basic components of a branch & bound technique that operates with topological sorting
Octav Brudaru, Cristian Rotaru
doaj  

Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm. [PDF]

open access: yesFront Pharmacol, 2022
Kusuma WA   +6 more
europepmc   +1 more source

Bioinspired Adaptive Surfaces for Intelligent Liquid Manipulation: Progressing From Passive and Active to Hybrid Strategies

open access: yesAdvanced Materials, EarlyView.
This review examines passive, active, and hybrid liquid manipulation strategies, highlighting hybrid approaches as an emerging route to reconcile energy efficiency with adaptive control. By actively reconstructing passive surfaces to store programmable interfacial energy, hybrid systems enable flexible yet low‐power liquid transport, with perspectives ...
Jiaqi Miao   +3 more
wiley   +1 more source

From Fiber Bundles to Architected Membranes: Triply Periodic Minimal Surface Architectures for Biohybrid Artificial Lungs

open access: yesAdvanced Materials, EarlyView.
Additively manufactured triply periodic minimal surface (TPMS) membranes offer an architecture‐driven alternative to hollow fiber bundles in artificial lungs. Multiphysics simulations and endothelialized prototypes show that the 3D‐printable membrane architecture improves gas exchange, blood flow distribution, and hemocompatibility, enabling ...
Michael Pflaum   +14 more
wiley   +1 more source

On Bornological Structure

open access: yesAcademic Science Journal
For multi criteria sequencing problem on one machine, we propose a modified branch and bound algorithm (MBAB) to find efficient (pareto optimal) solutions in this paper.
Anwar.N.I, Sh.K.Said Husain
doaj   +1 more source

Optimizing High-Speed Railroad Timetable with Passenger and Station Service Demands: A Case Study in the Wuhan-Guangzhou Corridor

open access: yesJournal of Advanced Transportation, 2018
This paper aims to optimize high-speed railroad timetables for a corridor. We propose an integer programming model using a time-space network-based approach to consider passenger service demands, train scheduling, and station service demands ...
Jin Wang   +4 more
doaj   +1 more source

Adapted Branch-and-Bound Algorithm Using SVM With Model Selection [PDF]

open access: yes, 2019
Branch-and-Bound algorithm is the basis for the majority of solving methods in mixed integer linear programming. It has been proving its efficiency in different fields.
El Afia Abdellatif   +3 more
core   +1 more source

Soft Skins With Reversible Thickness Morphing: Materials, Mechanisms, and Applications

open access: yesAdvanced Materials, EarlyView.
Evolution of electronic skin (e‐skin) technologies toward adaptive, multifunctional soft skins. Phase I highlights early rigid and discrete sensory interfaces. Phase II shows the transition toward flexible, stretchable, and large‐area e‐skin. Phase III captures the emergence of computational e‐skin.
Oliver Ozioko   +2 more
wiley   +1 more source

Single-Machine Scheduling with Simultaneous Learning Effects and Delivery Times

open access: yesMathematics
This paper studies the single-machine scheduling problem with truncated learning effect, time-dependent processing time, and past-sequence-dependent delivery time.
Zheng Liu, Ji-Bo Wang
doaj   +1 more source

An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem

open access: yesJournal of Control Science and Engineering, 2017
This paper presents an out space branch-and-bound algorithm for solving generalized affine multiplicative programs problem. Firstly, by introducing new variables and constraints, we transform the original problem into an equivalent nonconvex programs ...
Lei Cai   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy