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

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

Enhanced branch-and-bound algorithm for chance constrained programs with Gaussian mixture models Autor Wei, Jinxiang, Hu, Zhaolin, Luo, Jun, Zhu, Shushang

“…We study a class of chance constrained programs (CCPs) where the underlying distribution is modeled by a Gaussian mixture model. As the original work, Hu et…”
Získať plný text

Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch Autor Cesur, Elif, Rasit Cesur, Muhammet, Abraham, Ajith

“…The Branch and Bound (BB) algorithm, while ensuring optimality, often encounters performance bottlenecks, characterized by slow execution and high…”
Získať plný text

An enhanced branch-and-bound algorithm for the talent scheduling problem Autor Qin, Hu, Zhang, Zizhen, Lim, Andrew, Liang, Xiaocong

“…•The talent scheduling problem is formulated as an IP model.•An enhanced B&B algorithm is proposed for the problem.•We employ a novel lower bound and…”
Získať plný text

A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm Autor Mirhosseini, Mina, Fazlali, Mahmood, Fallah, Mohammad K, Lee, Jeong-A

“…Modeling high-level synthesis (HLS) as mixed integer linear programming (MILP) affords the opportunity to integrate constraints and optimization objectives of…”
Získať plný text

An enhanced branch-and-bound algorithm for a partitioning problem Autor Brusco, Michael J.

“…This paper focuses on the problem of developing a partition of n objects based on the information in a symmetric, non‐negative dissimilarity matrix. The goal…”
Získať plný text

An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem Autor Zhang, Zizhen, Hu, Qin, Liang, Xiaocong, Lim, Andrew

“…The talent scheduling problem is a simplified version of the real-world film shooting problem, which aims to determine a shooting sequence so as to minimize…”
Získať plný text

Homotopy continuation enhanced branch and bound algorithms for strongly nonconvex mixed‐integer nonlinear optimization Autor Ma, Yingjie, Li, Jie

“…Large‐scale strongly nonlinear and nonconvex mixed‐integer nonlinear programming (MINLP) models frequently appear in optimization‐based process synthesis,…”
Získať plný text

Homotopy Continuation Enhanced Branch and Bound Algorithms for Strongly Nonconvex Mixed-Integer Nonlinear Programming Problems Autor Ma, Yingjie, Li, Jie

“…Large-scale strongly nonlinear and nonconvex mixed-integer nonlinear programming (MINLP) models frequently appear in optimisation-based process synthesis,…”
Získať plný text

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management Autor Liu, Jian, Wunsch, Donald C., Wang, Siyuan, Bo, Rui

“…) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP…”
Získať plný text

Scheduling advertising slots for television Autor Brusco, M J

“… The contributions of this research paper are threefold. First, an enhanced branch-and-bound algorithm is presented and shown to produce optimal solutions for each of several problems that were not computationally feasible for a previously developed branch…”
Získať plný text

Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems Autor Li, Debiao, Ruan, Xiaoming, Yue, Qing

“…Along with the rising prevalence of chronic diseases and the increasing complexity of pharmaceutical care, pharmacy automation dispensing systems (PADS)s are…”
Získať plný text

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management Autor Liu, Jian, Wunsch II, Donald C., Wang, Siyuan, Bo, Rui

“…) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP…”
Získať plný text

Research on Dynamic Multi-Stage Emergency Material Allocation with Multiple Distribution Centers Autor Lou, Yuxin, Hu, Hui

“… and the total cost of material distribution. The Enhanced Branch-and-Bound algorithm is designed to directly solve Mixed-Integer Nonlinear Programming models…”
Získať plný text

Dynamic power adjustment and resource allocation framework for LTE networks Autor Secinti, Gokhan, Ozcevik, Muge Erel, Chowdhury, Kaushik R., Canberk, Berk

“… In order to solve this problem, we develop a heuristic approach called as Two Phase Enhanced Branch and Bound Algorithm (TPEBB…”
Získať plný text

Novel Optimisation Framework for Process Synthesis, Design and Intensification Using Rigorous Models Autor Ma, Yingjie

“…Facing the challenges of global warming, the appearance of new resources, the emergence of technologies, and the transitions of production modes, more…”
Získať plný text

A two-phase computational scheme for solving bang-bang control problems Autor Huang, Chih-Hung, Tseng, Ching-Huan

“… A numerical Two-Phase Scheme, which combines admissible optimal control problem formulation with enhanced branch-and-bound algorithms, is introduced to efficiently solve bang-bang control problems…”
Získať plný text