Search Results - "Branch and Bound Algorithm"

Analisis Optimasi Jalur Distribusi Menggunakan Pendekatan (Traveling Salesman Problem) untuk Meningkatkan Efisiensi Biaya Distribusi pada CV. Merdeka Pasuruan

Authors: Maulidi, M Agus

Source: Jurnal Teknik Industri Terintegrasi (JUTIN); Vol. 8 No. 4 (2025): October; 4142-4150

Subject Terms: Optimization, Traveling Salesman Problem, Branch and Bound Algorithm, Distribution

File Description: application/pdf

Access URL: https://journal.universitaspahlawan.ac.id/index.php/jutin/article/view/46624

The Obfuscated Network Steganography

Authors: Da-Chih Lin Shang-Yu Chou

Source: IEEE Access, Vol 13, Pp 26564-26574 (2025)

Subject Terms: BCH code, chi-square test, Electrical engineering. Electronics. Nuclear engineering, network steganography, Branch and bound algorithm, TK1-9971

Access URL: https://doaj.org/article/3831323985514e96a28cc31907693794

Using dual relaxations in multiobjective mixed-integer convex quadratic programming

Authors: Marianna De Santis Gabriele Eichfelder Daniele Patria et al.

Source: Journal of Global Optimization. 92:159-186

Subject Terms: Multiobjective optimization, Convex quadratic optimization, Mixed-integer quadratic programming, Branch-and-bound algorithm, ddc:510, multiobjective optimization, convex quadratic optimization, mixed-integer quadratic programming, branch-and-bound algorithm

File Description: application/pdf

Access URL: https://hdl.handle.net/10419/323385

Optimization of Export Container Relocation Operations Based on Policy Search Algorithm

Authors: CHEN Yifei, HAN Xiaolong, NIU Yafan

Source: Jisuanji gongcheng, Vol 51, Iss 9, Pp 362-372 (2025)

Subject Terms: relocation problem, heuristic algorithm, branch and bound algorithm, directional search algorithm, automated container terminal, Computer engineering. Computer hardware, TK7885-7895, Computer software, QA76.75-76.765

File Description: electronic resource

Relation: https://www.ecice06.com/fileup/1000-3428/PDF/jsjgc-51-9-362.pdf; https://doaj.org/toc/1000-3428

Access URL: https://doaj.org/article/1ff82d3648f44c279ad5ba6815d23d9b

Optimizing control variable selection with algorithms: Parsimony and precision in regression analysis

Authors: Fernando Campayo-Sanchez Juan Luis Nicolau Universidad de Alicante. Departamento de Marketing et al.

Contributors: Fernando Campayo-Sanchez Juan Luis Nicolau Universidad de Alicante. Departamento de Marketing et al.

Source: RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)

Subject Terms: Lasso models, branch and bound algorithm, Control variables, Variable selection, lasso models, Genetic algorithms, Branch and bound algorithm, control variables, variable selection, genetic algorithms

File Description: application/pdf

Access URL: http://hdl.handle.net/10045/147339

Solving a Global-Mixed Integer Signomial Geometric Fractional Programming Problem

Authors: J. Shirin Nejad M. Saraj

Source: Neutrosophic Sets and Systems, Vol 81, Pp 655-666 (2025)

Subject Terms: geometric programming, fractional programming, mixed integer programming, non-convex functions, spatial branch and bound algorithm, Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95

File Description: electronic resource

Relation: https://fs.unm.edu/NSS/39GlobalMixed.pdf; https://doaj.org/toc/2331-6055; https://doaj.org/toc/2331-608X

Access URL: https://doaj.org/article/664a5094ca974a7083581a5ac9ebec6b

A branch-and-bound algorithm with growing datasets for large-scale parameter estimation

Authors: Susanne Sass Alexander Mitsos Dominik Bongartz et al.

Source: European journal of operational research 316(1), 36-45 (2024). doi:10.1016/j.ejor.2024.02.020
European journal of operational research 316(1), [36]-45 (2024). doi:10.1016/j.ejor.2024.02.020

Subject Terms: Technology, Operations Research, Science & Technology, Spatial branch and bound algorithm, Operations Research & Management Science, MODELS, Social Sciences, 46 Information and computing sciences, Regression, Management, DETERMINISTIC GLOBAL OPTIMIZATION, PROGRAMS, Nonlinear programming, Business & Economics, Global optimization, RSM LIS, Large scale optimization, 49 Mathematical sciences, PARAMETER-ESTIMATION, 40 Engineering

Access URL: https://lirias.kuleuven.be/handle/20.500.12942/738896
https://doi.org/10.1016/j.ejor.2024.02.020
https://juser.fz-juelich.de/record/1025676
https://publications.rwth-aachen.de/record/981194

Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch

Authors: Elif Cesur Muhammet Raşit Cesur Ajith Abraham

Source: IEEE Access, Vol 12, Pp 93753-93760 (2024)

Subject Terms: enhanced branch and bound algorithm, pruning strategy, power dispatching optimization, 0202 electrical engineering, electronic engineering, information engineering, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, Branch and bound algorithm, TK1-9971

Access URL: https://doaj.org/article/9613fb2a9f2345049bb74614497e0645

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes

Authors: Encz, Koppány István Mastrolilli, Monaldo Vercesi, Eleonora et al.

Contributors: Encz, Koppány István Mastrolilli, Monaldo Vercesi, Eleonora et al.

Subject Terms: FOS: Computer and information sciences, Data Structures and Algorithms, Optimization and Control (math.OC), Optimization and Control, Branch-and-bound algorithm, FOS: Mathematics, Data Structures and Algorithms (cs.DS), ddc:004, Polynomial-time approximation scheme, Knapsack problem, Parallel machine scheduling problem

File Description: application/pdf

Access URL: http://arxiv.org/abs/2504.15885
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.73

Optimal Synthesis of Multi-output Boolean Functions Using Modern ILP Solvers

Authors: Alessandro Versari Marco Cococcioni

Source: Lecture Notes in Electrical Engineering ISBN: 9783031840999

Subject Terms: branch-and-bound algorithm, Exact minimization, integer linear programming, multi-output boolean functions, optimal synthesis

Separating the Yes- from the No-Instances in the Number Partitioning Problem

Authors: Horn, Ruben Jansen, Reitze van Eck, Okke et al.

Source: Proceedings of the 16th International Joint Conference on Computational Intelligence. :181-188

Subject Terms: Branch-and-Bound Algorithm, NP-hard, Greedy Algorithms, Number Partitioning Problem

Safe Peeling for $\ell_{0}$-Regularized Least-Squares

Authors: Guyard Théo Monnoyer de Galland de Carnières, Gilles Elvira Clément et al.

Contributors: Guyard Théo Monnoyer de Galland de Carnières, Gilles Elvira Clément et al.

Source: 2023 31st European Signal Processing Conference (EUSIPCO). :1748-1752

Subject Terms: Branch-and-Bound algorithm, Sparse model, L0 regularization, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], Branch-and- Bound algorithm, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], Branch and bound algorithm, [STAT.ML] Statistics [stat]/Machine Learning [stat.ML], L0-regularization

File Description: application/pdf

Access URL: https://hal.science/hal-04271074v1/document
https://hal.science/hal-04271074v1
https://doi.org/10.23919/eusipco58844.2023.10290041
https://hdl.handle.net/2078.1/295039

Solving weighted Maximum Satisfiability with Branch and Bound and clause learning

Authors: Coll, Jordi Li, Chu-Min Li, Shuolin et al.

Contributors: Coll, Jordi Li, Chu-Min Li, Shuolin et al.

Source: Digital.CSIC. Repositorio Institucional del CSIC
Consejo Superior de Investigaciones Científicas (CSIC)

Subject Terms: Branch-and-Bound algorithm, Combinatorial optimization, Clause learning, [INFO] Computer Science [cs], Weighted partial MaxSAT

File Description: application/pdf

Access URL: http://hdl.handle.net/10261/400280
https://api.elsevier.com/content/abstract/scopus_id/105010678363

A BRANCH-AND-BOUND ALGORITHM FOR TWO-COMPETING-AGENT SINGLE-MACHINE SCHEDULING PROBLEM WITH JOBS UNDER SIMULTANEOUS EFFECTS OF LEARNING AND DETERIORATION TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME WITH NO-TARDY JOBS

Authors: Danaci, Tugba Toksari, Duran

Subject Terms: Branch-and-bound algorithm, Deterioration effect, Learning effect, Multi-agent scheduling, Variable processing times

Access URL: https://hdl.handle.net/20.500.12587/23162

Global algorithm for effectively solving min-max affine fractional programs

Authors: Jiao, Hongwei Sun, Yudong Wang, Wenjie et al.

Source: Journal of Applied Mathematics and Computing. 70:1787-1811

Subject Terms: algorithmic complexity, linear relaxation technique, branch-relaxation-bound algorithm, min-max affine fractional programs, Fractional programming, Nonconvex programming, global optimization, Minimax problems in mathematical programming

File Description: application/xml

A Lower Bound for Minimizing Waiting Time in Coexisting Virtual and Physical Worlds

Authors: Yu-Chuan Chen Jen-Ya Wang

Source: IEEE Access, Vol 12, Pp 73470-73480 (2024)

Subject Terms: Multi-agent scheduling, completion time, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, branch-and-bound algorithm, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, lower bound, waiting time, TK1-9971

Access URL: https://doaj.org/article/1c3c6398d065473bbde633a3b9643ff4

Effective outcome space branch-and-bound algorithm for solving the sum of affine ratios problem

Authors: Yan Shi Qunzhen Zheng Jingben Yin

Source: AIMS Mathematics, Vol 9, Iss 9, Pp 23837-23858 (2024)

Subject Terms: sum of affine ratios problems, linearization technique, global optimization, outcome space branch-and-bound algorithm, fractional programs, QA1-939, 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, 01 natural sciences, Mathematics

Access URL: https://doaj.org/article/f6c72e0713b948348f85b3dd8fd25f52

Trains scheduling problem with multiple lines

Authors: Venkata Prathap Danavulapadu Purusotham Singamsetty

Source: Scientific Reports, Vol 14, Iss 1, Pp 1-20 (2024)

Subject Terms: Train scheduling, Routing, Branch and bound algorithm, Zero–one integer programming, Medicine, Science

File Description: electronic resource

Relation: https://doaj.org/toc/2045-2322

Access URL: https://doaj.org/article/d08e334369f44ced8db17edaa19f74d8

CliSAT: A new exact algorithm for hard maximum clique problems

Authors: Pablo San Segundo Fabio Furini David Álvarez et al.

Contributors: Pablo San Segundo Fabio Furini David Álvarez et al.

Source: Digital.CSIC. Repositorio Institucional del CSIC
Consejo Superior de Investigaciones Científicas (CSIC)

Subject Terms: Maximum clique problem, Combinatorial optimization, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Branch -and -bound algorithm, 02 engineering and technology, Branch-and-bound algorithm, Exact algorithm, Exact algorithms

File Description: application/pdf

Access URL: http://hdl.handle.net/10261/333850

The Optimization of Container Relocation in Terminal Yards: A Computational Study Using Strategy-Iterative Deepening Branch-and-Bound Algorithm

Authors: Jiangbei Zhang Jin Zhu

Source: Journal of Marine Science and Engineering, Vol 13, Iss 9, p 1743 (2025)

Subject Terms: restricted container relocation problem, strategy-oriented algorithm, strategy-iterative deepening branch-and-bound algorithm, early stopping mechanism, Naval architecture. Shipbuilding. Marine engineering, VM1-989, Oceanography, GC1-1581

File Description: electronic resource

Relation: https://www.mdpi.com/2077-1312/13/9/1743; https://doaj.org/toc/2077-1312

Access URL: https://doaj.org/article/e7c228b034124ccaa1e8eeeedff3faa3