Results 51 to 60 of about 244,573 (375)
, 2012 The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3.
A. Bjorklund +9 more
core +1 more source
Combining Interval Branch and Bound and Stochastic Search
Abstract and Applied Analysis, 2014 This paper presents global optimization algorithms that incorporate the idea of an interval branch and bound and the stochastic search algorithms.
Dhiranuch Bunnag
doaj +1 more source
PENENTUAN RUTE KENDARAAN PADA SISTEM DISTRIBUSI LOGISTIK PASCA BENCANA (STUDI KASUS)
Jurnal Manajemen Industri dan Logistik, 2018 The success indicators of disaster mitigation can be seen from the disaster logistics system. Effective and efficient distribution network can make a good disaster logistics system.
Andriansyah Andriansyah +1 more
doaj +1 more source
Distribution Route Optimization of Zakat Al-Fitr Based on the Branch-and-Bound Algorithm
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 The short interval between the collecting and distribution of zakat al-fitr is a recurring issue. As a result, ‘amil does not always pay attention to the ideal route, leading in inefficient transportation expenditures.
Noor Saif Muhammad Mussafi
doaj +1 more source
An ant colony algorithm for the sequential testing problem under precedence constraints. [PDF]
, 2008 We consider the problem of minimum cost sequential testing of a series (parallel) system under precedence constraints that can be modeled as a nonlinear integer program. We develop and implement an ant colony algorithm for the problem. We demonstrate
Catay, Bulent +5 more
core +2 more sources
Advanced Engineering Materials, EarlyView.Copper‐based composites enhanced with carbon feature convenient mechanical properties and favorable electric conductivity. Processing via deformation and thermomechanical treatments can introduce advantageous microstructures further enhancing their performance. Herein, copper–graphene powder‐based composites are directly consolidated via rotary swaging
Radim Kocich +3 more
wiley +1 more source
Branch and bound algorithms for maximizing expected improvement functions [PDF]
Journal of Statistical Planning and Inference, 2011 Deterministic computer simulations are often used as a replacement for complex physical experiments. Although less expensive than physical experimentation, computer codes can still be time-consuming to run. An effective strategy for exploring the response surface of the deterministic simulator is the use of an approximation to the computer code, such ...
Franey, Mark +2 more
openaire +3 more sources
Model Predictive Controller for piecewise affine system [PDF]
, 2005 2005 IFAC 16th Triennial World Congress, Prague, Czech RepublicThis paper presents a hybrid procedure to solve Model Predictive Controller (MPC) for Piecewise Affine System (PWA) The approach presented here belong to the class of Branch and Bound (B&B ...
Camacho, Eduardo F. +3 more
core +1 more source
Advanced Functional Materials, EarlyView.Bio‐based and (semi‐)synthetic zwitterion‐modified novel materials and fully synthetic next‐generation alternatives show the importance of material design for different biomedical applications. The zwitterionic character affects the physiochemical behavior of the material and deepens the understanding of chemical interaction mechanisms within the ...
Theresa M. Lutz +3 more
wiley +1 more source
A new branch and bound algorithm for minimax ratios problems
Open Mathematics, 2017 This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming ...
Zhao Yingfeng, Liu Sanyang, Jiao Hongwei
doaj +1 more source