„Branch-and-Bound“

Suchergebnisse

1.000+ Treffer

• A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
  Rakrouki, Mohamed Ali ; Kooli, Anis ; Chalghoumi, Sabrine ; Ladhari, Talel
• Multi-objective branch-and-bound for the design-for-control of water distribution networks with global bounds
  Ulusoy, Aly-Joy ; Stoianov, Ivan
• Duality-based branch–bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
  Agarwal, Deepika ; Singh, Pitam ; Bhati, Deepak ; Kumari, Saru ; Obaidat, Mohammad S.
• Branch and bound computational method for multi-objective linear fractional optimization problem
  Bhati, Deepak ; Singh, Pitam
• An Improved Branch and Bound Method for Mixed Integer Linear Fractional Programs
  Chandra, Suresh ; Chandramohan, M.
• Branch and Bound Technique for Integer Geometric Programming
  Patkar, Vivek ; Aggarwal, S. P.
• A Branch and Bound Method for Integer Nonlinear Fractional Programs
  Chandra, S. ; Chandramohan, M.
• Ein effektiver Branch and Bound‐Algorithmus für Boolesche quadratische Optimierungsprobleme
  Körner, F.
• Resolution Search and Dynamic Branch-and-Bound
  Hanafi, Saïd ; Glover, Fred
• Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming
  Brusco, Michael J. ; Stahl, Stephanie
• Polynomial Optimization: Tightening RLT-Based Branch-and-Bound Schemes with Conic Constraints
  González-Rodríguez, Brais ; Alvite-Pazó, Raúl ; Alvite-Pazó, Samuel ; Ghaddar, Bissan ; González-Díaz, Julio
• Grundzüge der Gemischt-ganzzahligen Optimierung
  Stein, Oliver 2024 Springer Berlin Heidelberg, Imprint: Springer Spektrum
• Publisher Correction: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
  Das Gupta, Shuvomoy ; Parys, Bart P. G. Van ; Ryu, Ernest K.
• Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
  Das Gupta, Shuvomoy ; Parys, Bart P. G. Van ; Ryu, Ernest K.
• Targeted Branching for the Maximum Independent Set Problem
  Hespe, Demian ; Lamm, Sebastian ; Schorr, Christian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Advancing mixed-integer programming using data-driven and deduction-based methods
  Chmiela, Antonia ; Pokutta, Sebastian ; Dadush, Daniel 2025 Technische Universität Berlin
• Multi-objective optimization in a finite time thermodynamic method for dish-Stirling by branch and bound method and MOPSO algorithm
  Nazemzadegan, Mohammad Reza ; Kasaeian, Alibakhsh ; Toghyani, Somayeh ; Ahmadi, Mohammad Hossein ; Saidur, R. ; Ming, Tingzhen
• Approaching the Boundaries of Endovascular Treatment in Acute Ischemic Stroke – Multicenter Experience with Mechanical Thrombectomy in Vertebrobasilar Artery Branch Occlusions
  Styczen, Hanna ; Fischer, Sebastian ; Yeo, Leonard LL ; Yong-Qiang Tan, Benjamin ; Maurer, Christoph J. ; Berlis, Ansgar ; Abdullayev, Nuran ; Kabbasch, Christoph ; Kastrup, Andreas ; Papanagiotou, Panagiotis ; Clajus, Christin ; Lobsien, Donald ; Piechowiak, Eike ; Kaesmacher, Johannes ; Maus, Volker
• Competition between Granule Bound Starch Synthase and Starch Branching Enzyme in Starch Biosynthesis
  Han, Huaxin ; Yang, Chuantian ; Zhu, Jihui ; Zhang, Lixia ; Bai, Yeming ; Li, Enpeng ; Gilbert, Robert G.
• Using branch-and-bound algorithms to optimize selection of a fixed-size breeding population under a relatedness constraint
  Mullin, T. J. ; Belotti, P.