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

  1. 1

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

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Elsevier B.V 01.06.2021
    “…•An enhanced branch-and-bound algorithm for a class of bilevel integer linear programming (BILP) problems…”
    Získať plný text
    Journal Article
  2. 2

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

    ISSN: 0254-5330, 1572-9338
    Vydavateľské údaje: New York Springer US 01.07.2024
    Vydané v Annals of operations research (01.07.2024)
    “… As the original work, Hu et al. (IISE Trans 54(12):1117–1130, 2022. https://doi.org/10.1080/24725854.2021.2001608 ) developed a spatial branch-and-bound…”
    Získať plný text
    Journal Article
  3. 3

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

    ISSN: 2169-3536, 2169-3536
    Vydavateľské údaje: Piscataway IEEE 2024
    Vydané v IEEE access (2024)
    “…The Branch and Bound (BB) algorithm, while ensuring optimality, often encounters performance bottlenecks, characterized by slow execution and high computational…”
    Získať plný text
    Journal Article
  4. 4

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

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Amsterdam Elsevier B.V 16.04.2016
    “… The branch-and-bound algorithm is enhanced by several accelerating techniques, including preprocessing…”
    Získať plný text
    Journal Article
  5. 5

    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

    ISSN: 0920-8542, 1573-0484
    Vydavateľské údaje: New York Springer US 01.07.2023
    Vydané v The Journal of supercomputing (01.07.2023)
    “… Despite the high potential of branch and bound (B&B) algorithms to solve MILP models quickly, computing the best answer is still an open challenge…”
    Získať plný text
    Journal Article
  6. 6

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

    ISSN: 0001-1541, 1547-5905
    Vydavateľské údaje: Hoboken, USA John Wiley & Sons, Inc 01.06.2022
    Vydané v AIChE journal (01.06.2022)
    “… In this study, we propose two robust homotopy continuation enhanced branch and bound (HCBB) algorithms (denoted as HCBB‐FP and HCBB‐RB) where the homotopy continuation…”
    Získať plný text
    Journal Article
  7. 7

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

    ISSN: 0007-1102, 2044-8317
    Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.05.2003
    “…‐and‐bound and other mathematical programming methods. An improved branch‐and‐bound algorithm is shown to be particularly efficient…”
    Získať plný text
    Journal Article
  8. 8

    Integrating deep learning with branch-and-bound algorithm for enhanced solution of hydrogen distribution: Integrating deep learning with branch-and-bound algorithm Autor Abibou, Soukayna, El Bourakadi, Dounia, Yahyaouy, Ali, Gualous, Hamid

    ISSN: 1573-0484
    Vydavateľské údaje: New York Springer US 01.12.2025
    Vydané v The Journal of supercomputing (01.12.2025)
    “… While exact methods like the branch-and-bound (B&B) algorithm offer robust solutions, their computational…”
    Získať plný text
    Journal Article
  9. 9

    Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds Autor Zhou, Xuesong, Zhong, Ming

    ISSN: 0191-2615, 1879-2367
    Vydavateľské údaje: Kidlington Elsevier Ltd 01.03.2007
    “… This research proposes a generalized resource-constrained project scheduling formulation which considers segment and station headway capacities as limited resources, and presents a branch-and-bound…”
    Získať plný text
    Journal Article
  10. 10

    A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem Autor Boulif, Menouar, Atif, Karim

    ISSN: 0305-0548, 0305-0548
    Vydavateľské údaje: Oxford Elsevier Science 01.08.2006
    Vydané v Computers & operations research (01.08.2006)
    “… were included to prevent placing certain machines in close vicinity. First, the problem is solved with a genetic algorithm (GA…”
    Získať plný text
    Journal Article
  11. 11

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

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 23.01.2014
    Vydané v arXiv.org (23.01.2014)
    “… The branch-and-bound algorithm is enhanced by several accelerating techniques, including preprocessing, dominance rules and caching search states…”
    Získať plný text
    Paper
  12. 12

    A Branch-and-Bound Enhanced Cooperative Evolutionary Algorithm for the Hybrid Seru System Scheduling Considering Worker Heterogeneity Autor Wu, Yuting, Wang, Ling, Chen, Jing-Fang

    ISSN: 1089-778X, 1941-0026
    Vydavateľské údaje: IEEE 01.08.2025
    “… To fill the gap, this article introduces a branch-and-bound enhanced cooperative evolutionary algorithm (BBCEA) to solve the HSSWH…”
    Získať plný text
    Journal Article
  13. 13

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

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 04.01.2022
    Vydané v arXiv.org (04.01.2022)
    “… In this work, we propose two robust homotopy continuation enhanced branch and bound (HCBB) algorithms (denoted as HCBB-FP and HCBB-RB…”
    Získať plný text
    Paper
  14. 14

    Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem Autor Li, Zixiang, Kucukkoc, Ibrahim, Tang, Qiuhua

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.07.2021
    Vydané v Computers & operations research (01.07.2021)
    “…s. This study presents an enhanced iterative branch, bound and remember (IBBRe) algorithm as an exact method and an enhanced iterative beam search (IBSe…”
    Získať plný text
    Journal Article
  15. 15

    Empowering branch-and-bound algorithms via reinforcement and imitation learning for enhanced search Autor Wang, Qi

    ISSN: 1568-4946
    Vydavateľské údaje: Elsevier B.V 01.02.2025
    Vydané v Applied soft computing (01.02.2025)
    “…) to achieve state-of-the-art performance in mastering advanced heuristics. However, existing RL-based algorithms depend on trial-and-error and extensive reward engineering…”
    Získať plný text
    Journal Article
  16. 16

    A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times Autor Bouabda, Radhouan, Jarboui, Bassem, Eddaly, Mansour, Rebaï, Abdelwaheb

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: Kidlington Elsevier Ltd 2011
    “… We develop a cooperative approach including a genetic algorithm and a branch and bound procedure…”
    Získať plný text
    Journal Article
  17. 17

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

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.08.2022
    Vydané v Computers & operations research (01.08.2022)
    “…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
    Journal Article
  18. 18

    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

    ISSN: 2352-4677, 2352-4677
    Vydavateľské údaje: Netherlands Elsevier Ltd 01.12.2024
    “…) 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
    Journal Article
  19. 19

    Green scheduling with time-of-use tariffs and machine states: Optimizing energy cost via branch-and-bound and bin packing strategies Autor Benedikt, Ondřej, Módos, István, Novak, Antonin, Hanzálek, Zdeněk

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Elsevier B.V 01.01.2026
    “…This paper presents a branch-and-bound algorithm, enhanced with bin packing strategies, for scheduling under variable energy pricing and power-saving states…”
    Získať plný text
    Journal Article
  20. 20

    Scheduling advertising slots for television Autor Brusco, M J

    ISSN: 0160-5682, 1476-9360
    Vydavateľské údaje: London Taylor & Francis 01.10.2008
    “… 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
    Journal Article