Suchergebnisse - "Branch and bound algorithm"

Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis von 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 …”
Volltext

A branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning von 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 …”
Volltext

A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization von 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 …”
Volltext

A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach von 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 …”
Volltext

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

“… ). The objective is to minimize the expected makespan of the project subject to precedence and resource constraints …”
Volltext

A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates von 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 …”
Volltext

A binary branch and bound algorithm to minimize maximum scheduling cost von 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 …”
Volltext

An effective branch-and-bound algorithm for convex quadratic integer programming von 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 …”
Volltext

A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint von 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 …”
Volltext

Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem von 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 …”
Volltext

A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations von 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 …”
Volltext

A branch & bound algorithm to determine optimal cross-splits for decision tree induction von 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 …”
Volltext

A Branch and Bound Algorithm for Single Machine Scheduling with Two Stages of Failure Process von 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 …”
Volltext

Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach von 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 …”
Volltext

Designing robust schedule coordination scheme for transit networks with safety control margins von 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 …”
Volltext

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

Volltext

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

“… A branch-and-bound algorithm incorporating these bounds and some dominance rules is proposed …”
Volltext

A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation von 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 …”
Volltext

An efficient branch-and-bound algorithm for optimal human pose estimation von 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 …”
Volltext

Efficient Global Algorithms for Transmit Beamforming Design in ISAC Systems von 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 …”
Volltext