An Exact Algorithm for Minimum Vertex Cover Problem
Mathematics, 2019 In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang +3 more
doaj +1 more source
Branch and bound algorithms for the bus evacuation problem [PDF]
Computers & Operations Research, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marc Goerigk, Bob Grün, Philipp Heßler
openaire +3 more sources
Branch and bound method for multiobjective pairing selection [PDF]
, 2010 Most of the available methods for selection of input-output pairings for decentralized control require evaluation of all alternatives to find the optimal pairings.
Kariwala, Vinay, Cao, Yi
core +1 more source
Globally optimal phasor measurement unit placement using branch and bound algorithm
Ain Shams Engineering Journal, 2021 This paper presents a new global optimal Phasor Measurement Unit (PMU) placement approach based on branch and bound algorithm. The proposed technique provides the global minimum number and locations of PMUs for any power system.
Mohamed Z. Kamh +2 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
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
A branch and bound method for isolation of faulty variables through missing variable analysis [PDF]
, 2010 Fault detection and diagnosis is a critical approach to ensure safe and efficient operation of manufacturing and chemical processing plants. Although multivariate statistical process monitoring has received considerable attention, investigation into ...
Tao Chen +11 more
core +1 more source
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