Search Results - "Branch & bound algorithms"

Branch-and-Cut Algorithms for Colorful Components Problems.

Authors: Archetti, Claudia Cerulli, Martina Sorgente, Carmine

Source: INFORMS Journal on Computing. May/Jun2026, Vol. 38 Issue 3, p693-709. 17p.

A Global Optimization Algorithm for K -Center Clustering of One Billion Samples.

Authors: Ren, Jiayang You, Ningning Hua, Kaixun et al.

Source: Management Science (INFORMS). Jun2026, Vol. 72 Issue 6, p5106-5130. 25p.

Spatial Branch-and-Bound for Nonconvex Separable Piecewise Linear Optimization.

Authors: Hübner, Thomas Gupte, Akshay Rebennack, Steffen

Source: INFORMS Journal on Computing. Mar/Apr2026, Vol. 38 Issue 2, p645-675. 31p.

Automatic source code generation for deterministic global optimization with parallel architectures.

Authors: Gottlieb, Robert X. Xu, Pengfei Stuber, Matthew D.

Source: Optimization Methods & Software; Apr2026, Vol. 41 Issue 2, p308-346, 39p

Branch-Relaxation-Bound Algorithm for Minimizing a Class of Sum of Affine Ratios Programming Problems.

Authors: Huang, Xiaoli Ma, Xiaohua Gao, Yuelin et al.

Source: Asia-Pacific Journal of Operational Research. Feb2026, Vol. 43 Issue 1, p1-33. 33p.

Decision support algorithms for short-term preventive maintenance planning of rolling stock.

Authors: Rudek, Izabela¹ rudek.izabela.ewa@gmail.com

Source: Operations Research & Decisions. 2026, Vol. 36 Issue 1, p93-120. 28p.

A STOCHASTIC PROGRAMMING APPROACH TO THE SINGLE MACHINE MAKESPAN PROBLEM WITH RANDOM BREAKDOWNS.

Alternate Title: RASTGELE ARIZALARIN OLDUĞU TEK MAKİNE TAMAMLAMA SÜRESİ PROBLEMİ İÇİN STOKASTİK PROGRAMLAMA YAKLAŞIMI.

Authors: GÜREL, Tarık AZİZOĞLU, Meral BATUN, Sakine

Source: Journal of Industrial Engineering (Turkish Chamber of Mechanical Engineers). 2026, Vol. 37 Issue 1, p210-240. 31p.

Subjects: Stochastic programming, Branch & bound algorithms, Machine part failures, Scheduling, Simulation methods & models, Production scheduling

Accelerating the Branch and Bound Algorithm for Solving the Extended Trust-Region Subproblems.

Authors: Dai, Jin-Yu¹ (AUTHOR) daiyk@126.com

Source: Journal of the Operations Research Society of China. Mar2026, Vol. 14 Issue 1, p229-245. 17p.

An exact algorithm for the minimum sum coloring problem on partially decomposable graphs.

Authors: Tammal, Fatma Aïder, Méziane

Source: RAIRO: Operations Research (2804-7303). 2025, Vol. 59 Issue 6, p3621-3648. 28p.

Subjects: Graph coloring, Branch & bound algorithms, Deterministic algorithms, Graph theory, Mathematical optimization

Two-machine permutation flow shop scheduling with generalized due dates to minimize total late work.

Authors: Choi, Byung-Cheon Park, Myoung-Ju Kim, Kyung Min

Source: Journal of Scheduling; Dec2025, Vol. 28 Issue 6, p563-576, 14p

线性乘积和规划问题的基于D.C.松弛的分支定界算法.

Alternate Title: A D.C. relaxation based branch-and-bound algorithm for sum-of-linear-products programming problems.

Authors: 张博 王红雨 高岳林

Source: Operations Research Transactions / Yunchouxue Xuebao. Dec2025, Vol. 29 Issue 4, p159-174. 16p.

针对炼油厂系统性运营优化问题的混合分布递归及 分支定界算法.

Alternate Title: A hybrid distribution recursion and branch and bound algorithm for Petroluem refinery optimization problem.

Authors: 孙鑫 葛冬冬 付德生 et al.

Source: Operations Research Transactions / Yunchouxue Xuebao. Dec2025, Vol. 29 Issue 4, p141-158. 18p.

Precise algorithms for minimizing feedback in new energy product development.

Authors: Wang, Peng Ma, Guangqi Ma, Xiaoyan et al.

Source: Scientific Reports. 11/17/2025, Vol. 15 Issue 1, p1-12. 12p.

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering.

Authors: Sudoso, Antonio M.¹, antoniomaria.sudoso@uniroma1.it

Source: INFORMS Journal on Computing; Nov/Dec2025, Vol. 37 Issue 6, p1433-1456, 24p

A new exact solution method for bi-level linear fractional problems with multi-valued optimal reaction maps.

Authors: Feleke, F.Y. Kassa, S.M.

Source: Iranian Journal of Numerical Analysis & Optimization. 2025, Vol. 15 Issue 4, p1392-1419. 28p.

Enhancing Branch-and-Bound for Multiobjective 0-1 Programming.

Authors: Forget, Nicolas Parragh, Sophie N.

Source: INFORMS Journal on Computing. Jan/Feb2024, Vol. 36 Issue 1, p285-304. 20p.

Towards competitive contractors' bids: optimizing selections of subcontractors and payment lags using branch and bound algorithm.

Authors: Gajpal, Yuvraj Islam, Md. Anisul Elazouni, Ashraf

Source: Construction Management & Economics. Apr2026, Vol. 44 Issue 4, p260-278. 19p.

Reliability optimization of multimodal routing and mode-jointing for dangerous goods freight: branch-and-bound and simulated annealing algorithms.

Authors: Kong, Wenqi Li, Man Shi, Hao et al.

Source: Transportation Planning & Technology. May2026, p1-45. 45p. 13 Illustrations.

Fast exact algorithms for the maximum diversity problem.

Authors: Lei, Jinping Liu, Lu Xiao, Mingyu et al.

Source: European Journal of Operational Research. Jun2026, Vol. 331 Issue 2, p396-405. 10p.

A scalable Branch, Bound, and Remember algorithm for picker routing with deadlines.

Authors: Bock, Stefan Boysen, Nils

Source: European Journal of Operational Research. Jun2026, Vol. 331 Issue 2, p406-420. 15p.