Výsledky vyhledávání - "branch and bound algorithm"

Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis Autor Babu, Rohit, Raj, Saurav, Dey, Bishwajit, Bhattacharyya, Biplab

“… The optimal phasor measurement unit (PMU) positioning problem (OPPP) is proposed to limit the number of PMUs deployed in the power grid and ensure the whole grid's observability in the meantime. A modified branch‐and‐bound algorithm (MBBA…”
Získat plný text

A branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning Autor Wang, Shijin, Liu, Ming

“…) in a single machine with its time to failure subject to a Weibull probability distribution. The objective is to minimise the total expected weighted completion time of jobs…”
Získat plný text

A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization Autor Buchheim, Christoph, De Santis, Marianna, Rinaldi, Francesco, Trieu, Long

“… We address this class of convex mixed-integer minimization problems by designing a branch-and-bound algorithm, where at each node, the continuous relaxation is solved by a non-monotone Frank…”
Získat plný text

A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach Autor KOUIDER, Ahmed, AIT HADDADÈNE, Hacène

“…•A bi-objective unit-time job shop scheduling is modeled as a mixed graph coloring.•A new branch-and-bound and an epsilon-constraint algorithms address…”
Získat plný text

A resource flow-based branch-and-bound algorithm to solve fuzzy stochastic resource-constrained project scheduling problem Autor Alipouri, Yaghoub

“…). The objective is to minimize the expected makespan of the project subject to precedence and resource constraints…”
Získat plný text

A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates Autor Rakrouki, Mohamed Ali, Kooli, Anis, Chalghoumi, Sabrine, Ladhari, Talel

“… We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration…”
Získat plný text

A binary branch and bound algorithm to minimize maximum scheduling cost Autor Chandra, Charu, Liu, Zhixin, He, Jun, Ruohonen, Toni

“… We develop a simple branch and bound algorithm to solve the scheduling problem optimally. A binary branching technique is developed…”
Získat plný text

An effective branch-and-bound algorithm for convex quadratic integer programming Autor Buchheim, Christoph, Caprara, Alberto, Lodi, Andrea

“…We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints…”
Získat plný text

A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint Autor Lee, Ju-Yong, Kim, Yeong-Dae

“… We present dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm…”
Získat plný text

Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem Autor Markevich, E. A., Trushechkin, A. S.

“…We propose a quantum branch-and-bound algorithm based on the general scheme of the branch-and-bound method and the quantum nested searching algorithm and examine its computational efficiency…”
Získat plný text

A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations Autor Buchheim, Christoph, De Santis, Marianna, Palagi, Laura

“…We propose two exact approaches for non-convex quadratic integer minimization subject to linear constraints where lower bounds are computed by considering ellipsoidal relaxations of the feasible set…”
Získat plný text

A branch & bound algorithm to determine optimal cross-splits for decision tree induction Autor Bollwein, Ferdinand, Dahmen, Martin, Westphal, Stephan

“…State-of-the-art decision tree algorithms are top-down induction heuristics which greedily partition the attribute space by iteratively choosing the best split…”
Získat plný text

A Branch and Bound Algorithm for Single Machine Scheduling with Two Stages of Failure Process Autor Azimpoor, Samareh, Taghipour, Sharareh

“… However, production environment is subject to many sources of uncertainty including machine unavailability periods, which may have a major impact on the production plan…”
Získat plný text

Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach Autor Amodio, S., D’Ambrosio, A., Siciliano, R.

“…). The well-known social choice problem consists in trying to find a reasonable procedure to use the aggregate preferences or rankings expressed by subjects to reach a collective decision…”
Získat plný text

Designing robust schedule coordination scheme for transit networks with safety control margins Autor Wu, Weitiao, Liu, Ronghui, Jin, Wenzhou

“… The schedule coordination problem then jointly optimises the planning headways and slack times in the timetable subject to SCM…”
Získat plný text

Optimal en-route charging station locations for electric vehicles with heterogeneous range anxiety Autor Zeng, Xueqi, Xie, Chi, Xu, Min, Chen, Zhibin

Získat plný text

A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem Autor Liaw, Ching-Fang

“… A branch-and-bound algorithm incorporating these bounds and some dominance rules is proposed…”
Získat plný text

A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation Autor Billionnet, Alain, Elloumi, Sourour, Lambert, Amélie

“…Let be a general mixed-integer quadratic program that consists of minimizing a quadratic function subject to linear constraints…”
Získat plný text

An efficient branch-and-bound algorithm for optimal human pose estimation Autor Min Sun, Telaprolu, M., Honglak Lee, Savarese, S.

“…Human pose estimation in a static image is a challenging problem in computer vision in that body part configurations are often subject to severe deformations and occlusions…”
Získat plný text

Efficient Global Algorithms for Transmit Beamforming Design in ISAC Systems Autor Wu, Jiageng, Wang, Zhiguo, Liu, Ya-Feng, Liu, Fan

“… problem whose objective is a weighted combination of the sum rate and the Cramér-Rao bound, subject to the transmit power budget…”
Získat plný text