Výsledky vyhľadávania - "branch and bound algorithm"

Branch-and-bound algorithm for optimal sparse canonical correlation analysis Autor Watanabe, Akihisa, Tamura, Ryuta, Takano, Yuichi, Miyashiro, Ryuhei

“… To exactly solve an MIO problem for optimal sparse CCA estimation, we propose a branch-and-bound algorithm based on the generalized eigenvalue problem for computing effective lower and upper bounds…”
Získať plný text

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts Autor Coniglio, Stefano, Furini, Fabio, San Segundo, Pablo

“…•A new efficient combinatorial branch and bound algorithm for solving the KPC is described…”
Získať plný text

A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem Autor Gmys, Jan, Mezmaz, Mohand, Melab, Nouredine, Tuyttens, Daniel

“…•An efficient exact algorithm for the permutation flow-shop scheduling problem.•Dynamic branching and parallel tree exploration are key ingredients.•Proposes a…”
Získať plný text

An anytime branch and bound algorithm for agile earth observation satellite onboard scheduling Autor Chu, Xiaogeng, Chen, Yuning, Tan, Yuejin

“…•We consider a bi-satellite cluster for targets recognition over sea.•We propose a mathematical model for the agile satellite scheduling problem.•We develop an…”
Získať plný text

An effective branch-and-bound algorithm for the maximum s-bundle problem Autor Zhou, Yi, Lin, Weibo, Hao, Jin-Kao, Xiao, Mingyu, Jin, Yan

“…•We exploit the properties of the maximum s-bundle problem.•A branch-and-bound algorithm is proposed for the maximum s-bundle problem…”
Získať plný text

Neural network assisted branch and bound algorithm for dynamic berth allocation problems Autor Korekane, Shinya, Nishi, Tatsushi, Tierney, Kevin, Liu, Ziang

“…One of the key challenges in maritime operations at container terminals is the need to improve or optimize berth operation schedules, thus allowing terminal…”
Získať plný text

A branch-and-bound algorithm with growing datasets for large-scale parameter estimation Autor Sass, Susanne, Mitsos, Alexander, Bongartz, Dominik, Bell, Ian H., Nikolov, Nikolay I., Tsoukalas, Angelos

“… We propose to exploit the structure of this class of optimization problems to enable their solution with the spatial branch-and-bound algorithm…”
Získať plný text

A branch and bound algorithm for continuous multiobjective optimization problems using general ordering cones Autor Wu, Weitian, Yang, Xinmin

“…Many existing branch and bound algorithms for multiobjective optimization problems require a significant computational cost to approximate the entire Pareto optimal solution set…”
Získať plný text

Reference-point-based branch and bound algorithm for multiobjective optimization Autor Wu, Wei-tian, Yang, Xin-min

“… A branch and bound algorithm that incorporates the decision maker’s preference information is proposed for this problem…”
Získať plný text

A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems Autor Kadri, Ahmed Abdelmoumene, Kacem, Imed, Labadi, Karim

“…•Several lower and upper bounds were proposed and incorporated in a branch-and-bound algorithm…”
Získať plný text

A branch and bound algorithm for scheduling trains in a railway network Autor D’Ariano, Andrea, Pacciarelli, Dario, Pranzo, Marco

“… We develop a branch and bound algorithm which includes implication rules enabling to speed up the computation…”
Získať plný text

A branch-and-bound algorithm for the quadratic multiple knapsack problem Autor Fleszar, Krzysztof

“…•We address the quadratic multiple knapsack problem.•We propose a new branch-and-bound algorithm…”
Získať plný text

An enhanced branch-and-bound algorithm for bilevel integer linear programming Autor Liu, Shaonan, Wang, Mingzheng, Kong, Nan, Hu, Xiangpei

“…•An enhanced branch-and-bound algorithm for a class of bilevel integer linear programming (BILP) problems…”
Získať plný text

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ískať plný text

A Branch-and-Bound Algorithm for a Class of Mixed Integer Linear Maximum Multiplicative Programs: A Bi-objective Optimization Approach Autor Ghasemi Saghand, Payman, Charkhgard, Hadi, Kwon, Changhyun

“…•We study a class of mixed integer non-linear optimization problems.•We develop a novel branch-and-bound algorithm…”
Získať plný text

An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming Autor Shen, Peiping, Wu, Dianxiao, Wang, Yafei

“…In this paper, a spatial branch-and-bound algorithm with an adaptive branching rule is proposed for solving linear multiplicative programming (LMP) problem…”
Získať plný text

Hybrid Classical–Quantum Branch-and-Bound Algorithm for Solving Integer Linear Problems Autor Sanavio, Claudio, Tignone, Edoardo, Ercolessi, Elisa

“… In order to deal with this issue, we propose the use of the classical branch-and-bound algorithm, that divides the problem into sub-problems which are described by a lower number of qubits…”
Získať plný text

A Branch and Bound Algorithm for Scheduling of Flexible Manufacturing Systems Autor Ahn, Jeongsun, Kim, Hyun-Jung

“…Flexible manufacturing systems (FMSs), which can easily adapt to changes in job types, have been widely used in manufacturing areas. Scheduling of FMSs is a…”
Získať plný text

Improved Branch and Bound algorithm and an interpolation-based search algorithm for quadratic minimization with one negative eigenvalue: Improved Branch and Bound algorithm and an interpolation-based Autor Salahi, M., Ansary Karbasy, S., Almaadeed, T. A., Hamdi, A.

“…In the literature a Branch and Bound (BB) algorithm is proposed for solving the quadratic minimization problem featuring a negative eigenvalue, a problem…”
Získať plný text

AB&B: An Anytime Branch and Bound Algorithm for Scheduling of Deadlock-Prone Flexible Manufacturing Systems Autor Luo, Jianchao, Zhou, Mengchu, Wang, Jun-Qiang

“…This work investigates a scheduling problem of deadlock-prone flexible manufacturing systems modeled by place-timed Petri nets. It proposes an anytime branch…”
Získať plný text