An Efficient Outer Space Algorithm for Generalized Linear Multiplicative Programming Problem
IEEE Access, 2020 Base on the outer space search and the branch-and-bound framework, this paper presents an efficient outer space branch-and-bound algorithm for globally solving generalized linear multiplicative programming problem.
Hongwei Jiao +4 more
doaj +1 more source
Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch
IEEE AccessThe Branch and Bound (BB) algorithm, while ensuring optimality, often encounters performance bottlenecks, characterized by slow execution and high computational overhead, especially when dealing with intricate or extensive problem instances (NP-Hard ...
Elif Cesur +2 more
doaj +1 more source
Single Machine Problem with Multi-Rate-Modifying Activities under a Time-Dependent Deterioration
Journal of Applied Mathematics, 2013 The single machine scheduling problem with multi-rate-modifying activities under a time-dependent deterioration to minimize makespan is studied. After examining the characteristics of the problem, a number of properties and a lower bound are proposed.
M. Huang +5 more
doaj +1 more source
Optimization of Export Container Relocation Operations Based on Policy Search Algorithm [PDF]
Jisuanji gongchengWith the rapid development of port logistics and the increasing prevalence of automated container terminals, the issue of relocating export containers at specific locations in yard bays has garnered significant attention.
CHEN Yifei, HAN Xiaolong, NIU Yafan
doaj +1 more source
Anomalies in parallel branch-and-bound algorithms [PDF]
Communications of the ACM, 1984 We consider the effects of parallelizing branch-and-bound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branch-and-bound algorithm using n 2 processors to take more time than one using n 1 processors, even though n ...
Lai, Ten-Hwang, Sahni, Sartaj
openaire +2 more sources
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
Bound-intersection detection for multiple-symbol differential unitary space-time modulation [PDF]
, 2005 This paper considers multiple-symbol differential detection (MSD) of differential unitary space-time modulation (DUSTM) over multiple-antenna systems. We derive a novel exact maximum-likelihood (ML) detector, called the bound-intersection detector (BID),
Cui, Tao, Tellambura, Chinthananda
core +1 more source
An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming
Journal of Applied Mathematics, 2014 An effective branch and bound algorithm is proposed for globally solving minimax linear fractional programming problem (MLFP). In this algorithm, the lower bounds are computed during the branch and bound search by solving a sequence of linear relaxation ...
Hong-Wei Jiao +2 more
doaj +1 more source
Scheduling of Software Test to Minimize the Total Completion Time
Mathematics, 2023 This paper investigates a single-machine scheduling problem of a software test with shared common setup operations. Each job has a corresponding set of setup operations, and the job cannot be executed unless its setups are completed. If two jobs have the
Man-Ting Chao, Bertrand M. T. Lin
doaj +1 more source
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