Search Results - programming: integer algorithm branch and bound

A hybrid branch-and-bound and interior-point algorithm for stochastic mixed-integer nonlinear second-order cone programming.

Authors: Alioui, Hadjer Alzalg, Baha

Source: Communications in Combinatorics & Optimization. Dec2025, Vol. 10 Issue 4, p837-875. 39p.

Subject Terms: *STOCHASTIC programming, *OPTIMIZATION algorithms, *MIXED integer linear programming, *BRANCH & bound algorithms, *ENGINEERING firms, *INTERIOR-point methods

Exact Complexity Certification of Suboptimal Branch-and-Bound Algorithms for Mixed-Integer Linear Programming

Authors: Shoja, Shamisa Axehill, Daniel

Source: IFAC PAPERSONLINE. :7428-7435

Subject Terms: Numerical methods for optimal control, Optimal control of hybrid systems, Mixed-integer linear programming, Branch and bound method, Complexity certification, Suboptimal solutions

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-202555
https://liu.diva-portal.org/smash/get/diva2:1851998/FULLTEXT01.pdf

Single machine scheduling with variable maintenance in the battery manufacturing.

Authors: Lee, Sang-Wook Kim, Hyun-Jung

Source: International Journal of Production Research; Dec2025, Vol. 63 Issue 23, p8859-8879, 21p

Subject Terms: LITHIUM-ion battery manufacturing, SCHEDULING, COMPUTER performance, HEURISTIC algorithms, COMPUTERIZED maintenance management systems, INTEGER programming, BRANCH & bound algorithms

Solving a Global-Mixed Integer Signomial Geometric Fractional Programming Problem.

Authors: Nejad, J. Shirin Saraj, M.

Source: Neutrosophic Sets & Systems. 2025, Vol. 81, p656-667. 12p.

Subject Terms: *GEOMETRIC programming, *BRANCH & bound algorithms, *NONCONVEX programming, *INDUSTRIAL design, *INTEGERS

Integer Linear Programming Model for Profit Maximization using Branch and Bound Algorithm in Retail Companies: Case of a Peruvian Company.

Authors: Chancahuana Castillo, John Diego Parisuaña Yucra, Willy Noe Soto, Mario Ninaquispe et al.

Source: Procedia Computer Science. 2024, Vol. 238, p1054-1061. 8p.

Subject Terms: Branch & bound algorithms, Profit maximization, Mixed integer linear programming, Inventory control

Branch and bound for the fixed-shape unequal area facility layout problem

Authors: Ekstedt, F. Salman, R. Damaschke, Peter

Source: Computers and Industrial Engineering. 203

Subject Terms: Combinatorial optimization, Branch and bound, Quadratic assignment problem, Unequal area facility layout planning, Mixed integer linear programming

File Description: electronic

Access URL: https://research.chalmers.se/publication/545461
https://research.chalmers.se/publication/545461/file/545461_Fulltext.pdf

A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints: A fast combinatorial algorithm for the bilevel knapsack...: N. Weninger, R. Fukasawa.

Authors: Weninger, Noah Fukasawa, Ricardo

Source: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p847-879. 33p.

Subject Terms: *BRANCH & bound algorithms, *DYNAMIC programming, *INTEGER programming, *KNAPSACK problems, *BACKPACKS, *ALGORITHMS, *BILEVEL programming

A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints.

Authors: Taktak, Raouia

Source: Annals of Operations Research; Aug2025, Vol. 351 Issue 1, p993-1021, 29p

Subject Terms: TRAVELING salesman problem, MIXED integer linear programming, CONSTRAINT programming, QUANTITATIVE research, MATHEMATICAL inequalities, BRANCH & bound algorithms, MATHEMATICAL optimization

The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability

Authors: Jäger, Gerold Climer, Sharlee Zhang, Weixiong

Source: Journal of Discrete Algorithms. 37:68-83

Subject Terms: Haplotype inference, Pure parsimony, Branch-and-bound, Integer programming, Boolean satisfiability

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-124271

A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm.

Authors: Mirhosseini, Mina Fazlali, Mahmood Fallah, Mohammad K et al.

Source: Journal of Supercomputing. Jul2023, Vol. 79 Issue 11, p12042-12073. 32p.

Subject Terms: *BRANCH & bound algorithms, *MIXED integer linear programming, *MATHEMATICAL forms, *FLOWGRAPHS, *NP-hard problems

Efficient algorithm for addressing large-scale linear fractional program problems.

Authors: Ge, Zhiguo Jiao, Hongwei

Source: AIMS Mathematics; 2025, Vol. 10 Issue 9, p1-21, 21p

Subject Terms: FRACTIONAL programming, ALGORITHMS, COMPUTATIONAL complexity, MATHEMATICAL transformations, BRANCH & bound algorithms, MATHEMATICAL optimization, INTEGER programming, HOSPITAL administration

The Capacitated Vehicle Routing Problem with Planned Downtime.

Authors: Landete, Mercedes Leal, Marina Monge, Juan Francisco et al.

Source: Computational Optimization & Applications; Nov2025, Vol. 92 Issue 2, p655-681, 27p

Subject Terms: VEHICLE routing problem, BILEVEL programming, TRANSPORTATION management, MIXED integer linear programming, SYSTEM downtime, BRANCH & bound algorithms, 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

Subject Terms: SCHEDULING, FLOW shops, PERMUTATIONS, BRANCH & bound algorithms, MIXED integer linear programming, DEADLINES, HEURISTIC

Solving Large‐Scale Weapon Target Assignment Problems in Seconds Using Branch‐Price‐And‐Cut.

Authors: Bertsimas, Dimitris Paskov, Alex

Source: Naval Research Logistics; Aug2025, Vol. 72 Issue 5, p735-749, 15p

Subject Terms: ASSIGNMENT problems (Programming), COLUMN generation (Algorithms), INTEGER programming, BRANCH & bound algorithms, MATHEMATICAL optimization

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

Authors: Sudoso, Antonio M.

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

Subject Terms: SEMIDEFINITE programming, BIPARTITE graphs, CLUSTER analysis (Statistics), EMPIRICAL research, BRANCH & bound algorithms, GRAPH theory, MATHEMATICAL programming

Feasible Path-Based Branch and Bound Algorithm for highly Nonconvex Mixed-Integer Nonlinear Programming Problems.

Authors: Chao Liu Yingjie Ma Dongda Zhang et al.

Source: CET Journal - Chemical Engineering Transactions; 2022, Vol. 94, p991-996, 6p

Subject Terms: BRANCH & bound algorithms, MIXED integer linear programming, NONCONVEX programming, MATHEMATICAL programming, COMPUTER simulation

Exact Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Linear Programming

Authors: Shoja, Shamisa, Biträdande professor Arnström, Daniel Axehill, Daniel, Biträdande professor

Source: Proceedings of 2022 Conference on Decision and Control (CDC) IEEE Conference on Decision and Control. :6298-6305

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-192390
https://liu.diva-portal.org/smash/get/diva2:1743306/FULLTEXT02.pdf

An optimization model for network design in disaster relief planning.

Alternate Title: Modelo de optimización para el diseño de redes de asistencia en catástrofe. (Spanish)

Authors: Palomino-Pacheco, Kevin Rafael García-Barrios, David Berdugo-Correa, Carmen Regina

Source: Revista Facultad de Ingeniería Universidad de Antioquia; Jul-Sep2025, Issue 116, p34-47, 14p

Subject Terms: DISASTER relief, MIXED integer linear programming, RESOURCE allocation, MATHEMATICAL optimization, BRANCH & bound algorithms, INFRASTRUCTURE (Economics)

Exact Complexity Certification of Start Heuristics in Branch-and-Bound Methods for Mixed-Integer Linear Programming

Authors: Shoja, Shamisa Axehill, Daniel

Source: 2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC IEEE Conference on Decision and Control. :2292-2299

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-201875
https://liu.diva-portal.org/smash/get/diva2:1847645/FULLTEXT01.pdf

Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming

Authors: Shoja, Shamisa, Biträdande professor Arnström, Daniel Axehill, Daniel, Biträdande professor

Source: 2022 AMERICAN CONTROL CONFERENCE (ACC). :4957-4964

Subject Terms: Mixed-integer quadratic Programming, Complexity Certification

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-188903
https://liu.diva-portal.org/smash/get/diva2:1700424/FULLTEXT02.pdf