Suchergebnisse - Spatial branch and bound algorithm*
-
1
An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
ISSN: 0377-0427, 1879-1778Veröffentlicht: Elsevier B.V 01.07.2023Veröffentlicht in Journal of computational and applied mathematics (01.07.2023)“… In this paper, a spatial branch-and-bound algorithm with an adaptive branching rule is proposed for solving linear multiplicative programming (LMP) problem …”
Volltext
Journal Article -
2
An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow
ISSN: 0885-8950, 1558-0679Veröffentlicht: New York IEEE 01.03.2022Veröffentlicht in IEEE transactions on power systems (01.03.2022)“… 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 …”
Volltext
Journal Article -
3
A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
ISSN: 1017-1398, 1572-9265Veröffentlicht: New York Springer US 01.07.2023Veröffentlicht in Numerical algorithms (01.07.2023)“… 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 …”
Volltext
Journal Article -
4
An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow
ISSN: 1944-9933Veröffentlicht: IEEE 21.07.2024Veröffentlicht in IEEE Power & Energy Society General Meeting (21.07.2024)“… 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 …”
Volltext
Tagungsbericht -
5
Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
ISSN: 1055-6788, 1029-4937Veröffentlicht: Abingdon Taylor & Francis 04.07.2017Veröffentlicht in Optimization methods & software (04.07.2017)“… Spatial branch-and-bound (B&B) is widely used for the global optimization of non-convex problems …”
Volltext
Journal Article -
6
A New Spatial Branch and Bound Algorithm for Quadratic Program with One Quadratic Constraint and Linear Constraints
ISSN: 1024-123X, 1563-5147Veröffentlicht: Cairo, Egypt Hindawi Publishing Corporation 2020Veröffentlicht in Mathematical problems in engineering (2020)“… We further derive a spatial branch-and-bound algorithm based on the new SOCP relaxation in order to obtain the global optimal solution …”
Volltext
Journal Article -
7
A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
ISSN: 0377-2217Veröffentlicht: Elsevier B.V 01.07.2024Veröffentlicht in European journal of operational research (01.07.2024)“… We propose to exploit the structure of this class of optimization problems to enable their solution with the spatial branch-and-bound algorithm …”
Volltext
Journal Article -
8
An exact algorithm for fleet co-deployment and slot co-chartering in a sustainable shipping alliance under emissions trading system
ISSN: 0377-2217Veröffentlicht: Elsevier B.V 01.12.2025Veröffentlicht in European journal of operational research (01.12.2025)“… •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 …”
Volltext
Journal Article -
9
A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs
ISSN: 0098-1354, 1873-4375Veröffentlicht: Elsevier Ltd 01.05.1999Veröffentlicht in Computers & chemical engineering (01.05.1999)“… The reformulated problem is then solved using a spatial branch-and-bound algorithm which branches on both integer and continuous variables …”
Volltext
Journal Article -
10
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
ISSN: 0926-6003, 1573-2894Veröffentlicht: New York Springer US 01.04.2025Veröffentlicht in Computational optimization and applications (01.04.2025)“… 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 …”
Volltext
Journal Article -
11
Data-Driven Spatial Branch-And-Bound Algorithm for Simulation-Based Optimization
ISBN: 9798263386337Veröffentlicht: ProQuest Dissertations & Theses 01.01.2021“… Rigorous computer simulation models are used routinely in chemical and other engineering and science disciplines to explain complex underlying phenomena …”
Volltext
Dissertation -
12
Solving a Global-Mixed Integer Signomial Geometric Fractional Programming Problem
ISSN: 2331-6055, 2331-608XVeröffentlicht: Neutrosophic Sets and Systems 01.07.2025Veröffentlicht in Neutrosophic sets and systems (01.07.2025)“… 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 …”
Volltext
Journal Article -
13
Aeromedical Battlefield Evacuation Under Endogenous Uncertainty in Casualty Delivery Times
ISSN: 0025-1909, 1526-5501Veröffentlicht: Linthicum INFORMS 01.12.2018Veröffentlicht in Management science (01.12.2018)“… ) a spatial branch-and-bound algorithm …”
Volltext
Journal Article -
14
Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
ISSN: 0925-5001, 1573-2916Veröffentlicht: New York Springer US 01.01.2022Veröffentlicht in Journal of global optimization (01.01.2022)“… 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 …”
Volltext
Journal Article -
15
On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination
ISSN: 1573-2894, 0926-6003, 1573-2894Veröffentlicht: New York, NY Springer US 01.04.2025Veröffentlicht in Computational optimization and applications (01.04.2025)“… 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 …”
Volltext
Journal Article -
16
Optimization of Urban Single-line Metro Timetable for Total Passenger Travel Time under Dynamic Passenger Demand
ISSN: 1877-7058, 1877-7058Veröffentlicht: Elsevier Ltd 2016Veröffentlicht in Procedia engineering (2016)“… Furthermore, a spatial branch and bound algorithm that is applicable to the model is presented …”
Volltext
Journal Article -
17
A symbolic reformulation/spatial branch-and-bound algorithm for the global optimization of nonconvex MINLP's
ISSN: 0098-1354Veröffentlicht: 15.11.2001Veröffentlicht in Computers & chemical engineering (15.11.2001)Volltext
Journal Article -
18
A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs: Special Issue: Selected and extended papers from the Symposium on PSE'97/ESCAPE'7
ISSN: 0098-1354, 1873-4375Veröffentlicht: Oxford Elsevier 1999Veröffentlicht in Computers & chemical engineering (1999)Volltext
Journal Article -
19
A symbolic reformulation/spatial branch-and-bound algorithm for the global optimization of nonconvex MINLP's: Edward M.B. Smith and Costas C. Pantelides, Center for Process Systems Engineering, Imperial College of Science, Technology and Medicine, London, UK
ISSN: 0098-1354, 1873-4375Veröffentlicht: Elsevier Ltd 2001Veröffentlicht in Computers & chemical engineering (2001)Volltext
Journal Article -
20
Data-Driven Spatial Branch-And-Bound Algorithms For Black-Box Optimization
ISBN: 9780128185971, 012818597XISSN: 1570-7946Veröffentlicht: 2019Veröffentlicht in Computer Aided Chemical Engineering (2019)“… 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 …”
Volltext
Buchkapitel

