Výsledky vyhľadávania - Spatial branch AND bound algorithm

On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination: On the Use of Restriction of the Right-hand Side in Spatial Branch Autor Kirst, Peter, Füllner, Christian

“…Spatial branch-and-bound algorithms for global minimization of non-convex problems require both lower and upper bounding procedures that finally converge to a globally optimal value in order to ensure…”
Získať plný text

An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow Autor Liu, Pengxiang, Wu, Zhi, Gu, Wei, Lu, Yuping

“… In this paper, an improved spatial branch-and-bound algorithm is proposed to solve the non-convex problem, which is formulated as a mixed-integer bilinear programming, for its exact solution…”
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

A spatial branch-reduction-bound algorithm for solving generalized linear fractional problems globally Autor Hou, Zhisong, Liu, Sanyang

Získať plný text

A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem Autor Peiping, Shen, Yafei, Wang, Dianxiao, Wu

“… Using the resulting second-order cone program (SOCP), we design a spatial branch and bound algorithm, which iteratively refines the piecewise linear approximations by dividing rectangles and solving a series of problems (SOCP…”
Získať plný text

Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization Autor Zhai, Jianyuan, Boukouvala, Fani

“… In this work, we present a novel data-driven spatial branch-and-bound algorithm for simulation-based optimization problems with box constraints, aiming for consistent globally convergent solutions…”
Získať plný text

On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination Autor Kirst, Peter, Füllner, Christian

“…Spatial branch-and-bound algorithms for global minimization of non-convex problems require both lower and upper bounding procedures that finally converge to a globally optimal value in order to ensure…”
Získať plný text

Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation Autor Castro, Pedro M.

“…Spatial branch-and-bound (B&B) is widely used for the global optimization of non-convex problems…”
Získať plný text

An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow Autor Liu, Pengxiang, Wu, Zhi, Gu, Wei, Lu, Yuping

“… In this paper, an improved spatial branch-and-bound algorithm is proposed to solve the non-convex problem, which is formulated as a mixedinteger bilinear programming, for its exact solution…”
Získať plný text

A New Spatial Branch and Bound Algorithm for Quadratic Program with One Quadratic Constraint and Linear Constraints Autor Zhou, Jing

“… We further derive a spatial branch-and-bound algorithm based on the new SOCP relaxation in order to obtain the global optimal solution…”
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

An exact algorithm for fleet co-deployment and slot co-chartering in a sustainable shipping alliance under emissions trading system Autor Wang, Yadong, Zhu, Shenghui, Iris, Çağatay

“…•A tailored spatial branch-and-bound algorithm is proposed to obtain the optimal solution.•A sustainable shipping alliance operates in a profitable, fair and environmentally friendly manner…”
Získať plný text

A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs Autor Smith, E.M.B., Pantelides, C.C.

“… The reformulated problem is then solved using a spatial branch-and-bound algorithm which branches on both integer and continuous variables…”
Získať plný text

Multimodal Microscopy Image Alignment Using Spatial and Shape Information and a Branch-and-Bound Algorithm Autor Chen, Shuonan, Rao, Bovey Y, Herrlinger, Stephanie, Losonczy, Attila, Paninski, Liam, Varol, Erdem

“…-and-bound algorithm to find subsets of point clouds that are in rotational alignment with each…”
Získať plný text

Data-Driven Spatial Branch-And-Bound Algorithm for Simulation-Based Optimization Autor Zhai, Jianyuan

“…Rigorous computer simulation models are used routinely in chemical and other engineering and science disciplines to explain complex underlying phenomena…”
Získať plný text

Solving a Global-Mixed Integer Signomial Geometric Fractional Programming Problem Autor Nejad, J. Shirin, Saraj, M

“… may still be dissatisfied with the rupture between the original objective function value and the relaxed value. Therefore, we apply a spatial branch and bound algorithm…”
Získať plný text

Aeromedical Battlefield Evacuation Under Endogenous Uncertainty in Casualty Delivery Times Autor Lejeune, Miguel A., Margot, Francois

“…) a spatial branch-and-bound algorithm…”
Získať plný text

Data-Driven Spatial Branch-And-Bound Algorithms For Black-Box Optimization Autor Zhai, Jianyuan, Boukouvala, Fani

“…The use of high fidelity simulations is becoming more common in computer-aided design and optimization. Due to the complexity of the simulation models and the…”
Získať plný text

Optimization of Urban Single-line Metro Timetable for Total Passenger Travel Time under Dynamic Passenger Demand Autor Shang, Pan, Li, Ruimin, Yang, Liya

“… Furthermore, a spatial branch and bound algorithm that is applicable to the model is presented…”
Získať plný text

A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints Autor Ito, Takao, Kao, Yonggui, Wang, Song, Hu, Shicheng, Sun, Xuedong

“… In order to solve SRCPSP to the optimum, a branch and bound algorithm (BB) is developed. For the BB-SRCPSP, first, an implicitly enumerative branch scheme is presented…”
Získať plný text