Log in

Relevant bibliographies by topics / Branch and bound / Journal articles

To see the other types of publications on this topic, follow the link: Branch and bound.

Journal articles on the topic 'Branch and bound'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Branch and bound.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Paulavičius, Remigijus, and Julius Žilinskas. "INFLUENCE OF LIPSCHITZ BOUNDS ON THE SPEED OF GLOBAL OPTIMIZATION." Technological and Economic Development of Economy 18, no. 1 (2012): 54–66. http://dx.doi.org/10.3846/20294913.2012.661170.

Full text

Abstract:

Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve various optimization problems. In this paper a bound for Lipschitz function is proposed, which is computed using function values at the vertices of a simplex and the radius of the circumscribed sphere. The efficiency of a branch and bound algorithm with proposed bound and combinations of bounds is evaluated experimentally while solving a number of multidimensional test problems for global optimization. The influence of different bounds on the performance of a branch and bound algorithm has been

APA, Harvard, Vancouver, ISO, and other styles

2

Jyoti, Arora, and Sharma Surbhi. "Solving Task Assignment Problem Using Branch and Bound Method." Journal of Applied Mathematics and Statistical Analysis 4, no. 1 (2023): 1–7. https://doi.org/10.5281/zenodo.7813430.

Full text

Abstract:

<em>The main aim of this paper is to present an algorithm of Branch and Bound method for solving task assignment problem. The branch and bound approach is based on divide and conquer method in which large problem is divided into smaller subsets of solutions. Our algorithm calculates lower bounds on solutions to the Task Assignment problem, which is further divided into subsets. Experimental results show that this Branch and Bound method to solve Task Assignment problem shows better results than standard Hungarian Method. A Numerical example is taken to illustrate the solution procedure</em>

APA, Harvard, Vancouver, ISO, and other styles

3

Eichfelder, Gabriele, Peter Kirst, Laura Meng, and Oliver Stein. "A general branch-and-bound framework for continuous global multiobjective optimization." Journal of Global Optimization 80, no. 1 (2021): 195–227. http://dx.doi.org/10.1007/s10898-020-00984-y.

Full text

Abstract:

AbstractCurrent generalizations of the central ideas of single-objective branch-and-bound to the multiobjective setting do not seem to follow their train of thought all the way. The present paper complements the various suggestions for generalizations of partial lower bounds and of overall upper bounds by general constructions for overall lower bounds from partial lower bounds, and by the corresponding termination criteria and node selection steps. In particular, our branch-and-bound concept employs a new enclosure of the set of nondominated points by a union of boxes. On this occasion we also

APA, Harvard, Vancouver, ISO, and other styles

4

Hartwig, A. "Recursive branch and bound." Optimization 16, no. 2 (1985): 219–28. http://dx.doi.org/10.1080/02331938508843011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Luzhi, Shuli Hu, Mingyang Li, and Junping Zhou. "An Exact Algorithm for Minimum Vertex Cover Problem." Mathematics 7, no. 7 (2019): 603. http://dx.doi.org/10.3390/math7070603.

Full text

Abstract:

In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower bounds to help prune the search space. One is based on the degree of vertices, and the other is based on MaxSAT reasoning. The experiment confirms that our algorithm is faster than previous exact algorithms and can find better results than heuristic algorithms.

APA, Harvard, Vancouver, ISO, and other styles

6

Jiao, Hong-Wei, Feng-Hui Wang, and Yong-Qiang Chen. "An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming." Journal of Applied Mathematics 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/160262.

Full text

Abstract:

An effective branch and bound algorithm is proposed for globally solving minimax linear fractional programming problem (MLFP). In this algorithm, the lower bounds are computed during the branch and bound search by solving a sequence of linear relaxation programming problems (LRP) of the problem (MLFP), which can be derived by using a new linear relaxation bounding technique, and which can be effectively solved by the simplex method. The proposed branch and bound algorithm is convergent to the global optimal solution of the problem (MLFP) through the successive refinement of the feasible region

APA, Harvard, Vancouver, ISO, and other styles

7

Moursli, Omar. "Branch and Bound Lower Bounds for the Hybrid Flowshop." IFAC Proceedings Volumes 30, no. 14 (1997): 31–36. http://dx.doi.org/10.1016/s1474-6670(17)42693-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhou, Xue-Gang, and Bing-Yuan Cao. "A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming." Journal of Applied Mathematics 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/984168.

Full text

Abstract:

A simplicial branch and bound duality-bounds algorithm is presented to globally solving the linear multiplicative programming (LMP). We firstly convert the problem (LMP) into an equivalent programming one by introducingpauxiliary variables. During the branch and bound search, the required lower bounds are computed by solving ordinary linear programming problems derived by using a Lagrangian duality theory. The proposed algorithm proves that it is convergent to a global minimum through the solutions to a series of linear programming problems. Some examples are given to illustrate the feasibilit

APA, Harvard, Vancouver, ISO, and other styles

9

Sarkar, U. K., P. P. Chakrabarti, S. Ghose, and S. C. De Sarkar. "Multiple stack branch and bound." Information Processing Letters 37, no. 1 (1991): 43–48. http://dx.doi.org/10.1016/0020-0190(91)90248-g.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Przybylski, Anthony, and Xavier Gandibleux. "Multi-objective branch and bound." European Journal of Operational Research 260, no. 3 (2017): 856–72. http://dx.doi.org/10.1016/j.ejor.2017.01.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Jansen, J. M., and F. W. Sijstermans. "Parallel branch-and-bound algorithms." Future Generation Computer Systems 4, no. 4 (1989): 271–79. http://dx.doi.org/10.1016/0167-739x(89)90003-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Zumaytis, Sofriesilero, and Oscar Karnalim. "Introducing an Educational Tool for Learning Branch & Bound Strategy." Journal of Information Systems Engineering and Business Intelligence 3, no. 1 (2017): 8. http://dx.doi.org/10.20473/jisebi.3.1.8-15.

Full text

Abstract:

Abstract—According to our informal survey, Branch & Bound strategy is considerably difficult to learn compared to other strategies. This strategy consists of several complex algorithmic steps such as Reduced Cost Matrix (RCM) calculation and Breadth First Search. Thus, to help students understanding this strategy, AP-BB, an educational tool for learning Branch & Bound is developed. This tool includes four modules which are Brute Force solving visualization, Branch & Bound solving visualization, RCM calculator, and case-based performance comparison. These modules are expected to enh

APA, Harvard, Vancouver, ISO, and other styles

13

Kahribt, Tahani Jabbar, and Mohammed Kadhim Al- Zuwaini. "Branch and Bound Method to Solve Multi Objectives Function." JOURNAL OF ADVANCES IN MATHEMATICS 12, no. 3 (2016): 5964–74. http://dx.doi.org/10.24297/jam.v12i3.494.

Full text

Abstract:

This paper presents a branch and bound algorithm for sequencing a set of n independent jobs on a single machine to minimize sum of the discounted total weighted completion time and maximum lateness, this problems is NP-hard. Two lower bounds were proposed and heuristic method to get an upper bound. Some special cases were proved and some dominance rules were suggested and proved, the problem solved with up to 50 jobs.

APA, Harvard, Vancouver, ISO, and other styles

14

Mohammed, Kadhom Alzwuiani, and Ali Zeyad Asmaa. "Using Branch and Bound Method to Minimize Bi-Criteria." Journal of Progressive Research in Mathematics 7, no. 1 (2016): 907–16. https://doi.org/10.5281/zenodo.4033047.

Full text

Abstract:

This paper presents a branch and bound algorithm for sequencing a set of n<strong> </strong>independent jobs on a single machine to minimize sum of total late work and the number of tardy jobs, the type of the problem is NP-hard.Lower bounds were proposed and heuristic method to get an upper bound. Some special cases were proved and some dominancerules were proposed and proved, the problem solved with up to 40 jobs.

APA, Harvard, Vancouver, ISO, and other styles

15

Paulavičius, Remigijus, and Julius Žilinskas. "GLOBAL OPTIMIZATION USING THE BRANCH‐AND‐BOUND ALGORITHM WITH A COMBINATION OF LIPSCHITZ BOUNDS OVER SIMPLICES." Technological and Economic Development of Economy 15, no. 2 (2009): 310–25. http://dx.doi.org/10.3846/1392-8619.2009.15.310-325.

Full text

Abstract:

Many problems in economy may be formulated as global optimization problems. Most numerically promising methods for solution of multivariate unconstrained Lipschitz optimization problems of dimension greater than 2 use rectangular or simplicial branch‐and‐bound techniques with computationally cheap, but rather crude lower bounds. The proposed branch‐and‐bound algorithm with simplicial partitions for global optimization uses a combination of 2 types of Lipschitz bounds. One is an improved Lipschitz bound with the first norm. The other is a combination of simple bounds with different norms. The e

APA, Harvard, Vancouver, ISO, and other styles

16

Munapo, Elias, Joshua Chukwuere, and Trust Tawanda. "Solving Linear Integer Models with Variable Bounding." Forecasting 5, no. 2 (2023): 443–52. http://dx.doi.org/10.3390/forecast5020024.

Full text

Abstract:

We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal integer solution. With the variable bounds of the basic variables known, solving a linear integer model is easier by using either the branch and bound, branch and cut, branch and price, branch cut and price, or branch cut and free algorithms. Thus, the search for large numbers of subproblems, which are unnecessary and common for NP Complete linear

APA, Harvard, Vancouver, ISO, and other styles

17

Sawaluddin and Maharani Beruh. "Analysis Of Branch And Cut And Branch And Bound Methods To Solve Mixed Integer Linear Programming Problems." Journal of Mathematics Technology and Education 3, no. 4 (2024): 401–11. https://doi.org/10.32734/jomte.v3i4.12499.

Full text

Abstract:

Mixed integer linear programming is a combinatorial optimization problem that is difficult to solve efficiently. One method that can be used to solve mixed integer linear programming problems is the branch and bound and branch and cut methods. The Branch and Bound method is a working procedure that takes a long time to find the optimal solution that is achieved. This method uses the results of the simplex method which does not have an integer value so that branching and limitations are carried out on the variable with the largest fractional value. The branch and cut method is a combination of

APA, Harvard, Vancouver, ISO, and other styles

18

Wang, Zhenyou, Cai-Min Wei, and Yuan-Yuan Lu. "Permutation Flow Shop Problem with Shortening Job Processing Times." Asia-Pacific Journal of Operational Research 33, no. 04 (2016): 1650032. http://dx.doi.org/10.1142/s0217595916500329.

Full text

Abstract:

In this paper, we consider a three-machine makespan minimization permutation flow shop scheduling problem with shortening job processing times. Shortening job processing times means that its processing time is a nonincreasing function of its execution start time. Optimal solutions are obtained for some special cases. For the general case, several dominance properties and two lower bounds are developed to construct a branch-and-bound (B&B) algorithm. Furthermore, we propose a heuristic algorithm to overcome the inefficiency of the branch-and-bound algorithm.

APA, Harvard, Vancouver, ISO, and other styles

19

Fletcher, Roger, and Sven Leyffer. "Numerical Experience with Lower Bounds for MIQP Branch-And-Bound." SIAM Journal on Optimization 8, no. 2 (1998): 604–16. http://dx.doi.org/10.1137/s1052623494268455.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

JESUS, E., and M. T. RODRIGUES. "SEQUENCING OF TASKS WITH SETUP TIMES USING BRANCH AND BOUND." Revista Gestão, Inovação e Tecnologias 4, no. 3 (2014): 1062–75. http://dx.doi.org/10.7198/s2237-0722201400030006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Subrahmanian, V. S., D. Nau, and C. Vago. "WFS + branch and bound = stable models." IEEE Transactions on Knowledge and Data Engineering 7, no. 3 (1995): 362–77. http://dx.doi.org/10.1109/69.390244.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

HERLEY, KIERAN T., ANDREA PIETRACAPRINA, and GEPPINO PUCCI. "FAST DETERMINISTIC PARALLEL BRANCH-AND-BOUND." Parallel Processing Letters 09, no. 03 (1999): 325–33. http://dx.doi.org/10.1142/s012962649900030x.

Full text

Abstract:

The branch-and-bound problem involves determining the minimum cost leaf in a cost-labelled tree, subject to the constraint that only the root is known initially and that children are revealed only by visiting thier parent. We present the first efficient deterministic algorithm to solve the branch-and-bound problem for a tree T of constant degree on a p-processor parallel machine. Let c* be the cost of the minimum-cost leaf in T, and let n and h be the number of nodes and the height, respectively, of the subtree T* ⊆ T of nodes of cost less than or equal to c*. Our algorithm runs in O(n/p + h l

APA, Harvard, Vancouver, ISO, and other styles

23

Chun-Hung Cheng. "A branch and bound clustering algorithm." IEEE Transactions on Systems, Man, and Cybernetics 25, no. 5 (1995): 895–98. http://dx.doi.org/10.1109/21.376504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Archibald, Blair, Patrick Maier, Ciaran McCreesh, Robert Stewart, and Phil Trinder. "Replicable parallel branch and bound search." Journal of Parallel and Distributed Computing 113 (March 2018): 92–114. http://dx.doi.org/10.1016/j.jpdc.2017.10.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Jang, S. W., Y. J. Park, and G. Y. Kim. "Branch-and-bound dynamic time warping." Electronics Letters 46, no. 20 (2010): 1374. http://dx.doi.org/10.1049/el.2010.1287.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Lestari, Sesa Tri, and Caturiyati Caturiyati. "OPTIMASI MODEL INTEGER LINEAR PROGRAMMING PADA PRODUKSI GETUK GORENG MENGGUNAKAN ALGORITMA B&B." Jurnal Kajian dan Terapan Matematika 9, no. 1 (2023): 1–13. https://doi.org/10.21831/jktm.v9i1.19327.

Full text

Abstract:

AbstrakPenelitian ini bertujuan untuk merumuskan pemodelan matematika dari produksi getuk goreng Nanang Putra dengan integer linear progamming. Algoritma BB (Branch and Bound) merupakan salah satu metode penyelesaian optimum integer linear programming yang menghasilkan variabel-variabel keputusan integer. Berdasarkan hasil penelitian, keuntungan maksimum dalam sehari yang diperoleh produsen getuk goreng Nanang Putra menggunakan algoritma BB (Branch and Bound) adalah sebesar dengan banyaknya produksi getuk goreng varian original sebanyak 200 besek, varian nangka sebanyak 146 besek, dan varian d

APA, Harvard, Vancouver, ISO, and other styles

27

Elaibi, Waleed Mohammed. "Branch and Bound Algorithm and an Improvement for Calculating the Nearest Link of Building a Railway Network." Al-Mustansiriyah Journal of Science 31, no. 4 (2020): 114. http://dx.doi.org/10.23851/mjs.v31i4.923.

Full text

Abstract:

The importance of branch and bound algorithm is the mathematical improvement to find the value of (X) that Maximize or minimize the objective function within a set of feasible solution, as it is reliable on the efficient evaluation of the bounds of regions or branches of the space of the research, whether they are upper or lower. In this paper, we discussed five cases with respect to branching decisions based on network solutions to calculate the nearest link with a short time. From the results, bound and branch algorithm can develop and change the obtaining solutions for the five cases under

APA, Harvard, Vancouver, ISO, and other styles

28

Nur, Wahyudin, and Nurul Mukhlisah Abdal. "Penggunaan Metode Branch and Bound dan Gomory Cut dalam Menentukan Solusi Integer Linear Programming." SAINTIFIK 2, no. 1 (2017): 9–15. http://dx.doi.org/10.31605/saintifik.v2i1.91.

Full text

Abstract:

Integer Linear Programming adalah sebuah model matematis yang memungkinkan hasil penyelesaian kasus pada Pemrograman Linier berupa bilangan bulat. . Masalah integer linear programming termasuk salah satu bagian riset operasi yang sangat penting karena dalam kehidupan sehari-hari, ada banyak permasalah pemrograman linear yang mengharuskan solusinya integer. Ada beberapa metode untuk menyelesaikan persoalan Integer Programming, tapi yang akan dibahas pada penelitian ini adalah Metode Branch and Bound dan Metode Gomory Cut. Tujuan dari penelitian ini adalah untuk menentukan solusi masalah Integer

APA, Harvard, Vancouver, ISO, and other styles

29

Utama, Dana Marsetiya. "Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan." PROZIMA (Productivity, Optimization and Manufacturing System Engineering) 2, no. 1 (2019): 20. http://dx.doi.org/10.21070/prozima.v2i1.1527.

Full text

Abstract:

This article discussed the problem of flow shop scheduling to minimize the makespan. The purpose of this article is to develop the LPT and Branch And Bound (LPT-Branch And Bound) algorithms to minimize the makespan. The proposed method is Longest Processing Time (LPT) and Branch And Bound. Stage settlement is divided into 3 parts. To proved the proposed algorithm, a numerical experiment was conducted by comparing the LPT-LN algorithm. The result of the numerical experiment shows that LPT-Branch And Bound's proposed algorithm is more efficient than the LPT-LN algorithm.

APA, Harvard, Vancouver, ISO, and other styles

30

CLAUSEN, JENS, and JESPER LARSSON TRÄFF. "DO INHERENTLY SEQUENTIAL BRANCH-AND-BOUND ALGORITHMS EXIST?" Parallel Processing Letters 04, no. 01n02 (1994): 3–13. http://dx.doi.org/10.1142/s0129626494000028.

Full text

Abstract:

In the construction of algorithms for [Formula: see text] optimization problems the Branch-and-Bound paradigm is an essential tool. Furthermore, Branch-and-Bound algorithms are traditionally regarded as well suited for parallel implementation due to the subdivision of the problem considered into essentially independent subproblems. In this paper we present experimental results for a Branch-and-Bound algorithm for the Graph Partitioning Problem showing that the traditional parallelization of a Branch-and-Bound algorithm does not always lead to an efficient parallel algorithm. The main reason se

APA, Harvard, Vancouver, ISO, and other styles

31

Yeoh, W., A. Felner, and S. Koenig. "BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm." Journal of Artificial Intelligence Research 38 (May 23, 2010): 85–133. http://dx.doi.org/10.1613/jair.2849.

Full text

Abstract:

Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. A DCOP problem is a problem where several agents coordinate their values such that the sum of the resulting constraint costs is minimal. It is often desirable to solve DCOP problems with memory-bounded and asynchronous algorithms. We introduce Branch-and-Bound ADOPT (BnB-ADOPT), a memory-bounded asynchronous DCOP search algorithm that uses the message-passing and communication framework of ADOPT (Modi, Shen, Tambe, & Yokoo, 2005), a well known memory-bounded asynchr

APA, Harvard, Vancouver, ISO, and other styles

32

Chu, Sydney C. K. "Efficient bounds on a branch and bound algorithm for graph colouration." International Journal of Mathematical Education in Science and Technology 22, no. 5 (1991): 823–32. http://dx.doi.org/10.1080/0020739910220516.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Et. al., Sriyani Violina,. "Branch And Bound Algorithm Analysis For Solving Job Assignment Problems." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 11 (2021): 1272–76. http://dx.doi.org/10.17762/turcomat.v12i11.6031.

Full text

Abstract:

The Branch & Bound algorithm is a method commonly used to solve optimization problems. Some examples of problems that the Branch & Bound algorithm can solve are Knapsack Problems, Traveling Salesman Problems, Scheduling Problems and many other optimization problems. Job Assignment Problem is one of the optimization problems of how to do n people doing n jobs where one person does one job. This paper will analyze the Branch and Bound Algorithm in solving Job Assignments Problem.

APA, Harvard, Vancouver, ISO, and other styles

34

VALENTE, JORGE M. S. "AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES." Asia-Pacific Journal of Operational Research 25, no. 02 (2008): 169–86. http://dx.doi.org/10.1142/s0217595908001730.

Full text

Abstract:

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We propose a lower bounding procedure based on the relaxation of the jobs' completion times. Optimal branch-and-bound algorithms are then presented. These algorithms incorporate the proposed lower bound, as well as an insertion-based dominance test. The branch-and-bound procedures are tested on a wide set of randomly generated problems. The computational results show that the branch-and-bound algorithms are capable of optimally solving, within reasonab

APA, Harvard, Vancouver, ISO, and other styles

35

Lv, Zheng-Guo, Li-Han Zhang, Xiao-Yuan Wang, and Ji-Bo Wang. "Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization." Mathematics 12, no. 4 (2024): 610. http://dx.doi.org/10.3390/math12040610.

Full text

Abstract:

In this paper, we investigate a single machine scheduling problem with a proportional job deterioration. Under release times (dates) of jobs, the objective is to minimize the total weighted completion time. For the general condition, some dominance properties, a lower bound and an upper bound are given, then a branch-and-bound algorithm is proposed. In addition, some meta-heuristic algorithms (including the tabu search (TS), simulated annealing (SA) and heuristic (NEH) algorithms) are proposed. Finally, experimental results are provided to compare the branch-and-bound algorithm and another thr

APA, Harvard, Vancouver, ISO, and other styles

36

Mencía, Carlos, María Sierra, and Ramiro Varela. "Partially Informed Depth-First Search for the Job Shop Problem." Proceedings of the International Conference on Automated Planning and Scheduling 20 (May 25, 2021): 113–20. http://dx.doi.org/10.1609/icaps.v20i1.13407.

Full text

Abstract:

We propose a partially informed depth-first search algorithm to cope with the Job Shop Scheduling Problem with makespan minimization. The algorithm is built from the well-known P. Brucker's branch and bound algorithm. We improved the heuristic estimation of Brucker's algorithm by means of constraint propagation rules and so devised a more informed heuristic which is proved to be monotonic. We conducted an experimental study across medium and large instances. The results show that the proposed algorithm reaches optimal solutions for medium instances taking less time than branch and bound and th

APA, Harvard, Vancouver, ISO, and other styles

37

Juliani and Heliawati Hamrul. "Optimasi Distribusi Buku menggunakan Algoritma Branch and Bound untuk Efisiensi Rute Terpendek." Journal of Computer and Information System ( J-CIS ) 5, no. 2 (2023): 13–25. http://dx.doi.org/10.31605/jcis.v5i2.2550.

Full text

Abstract:

Pendistribusian buku di Polewali Mandar. Pendistribusian buku dilakukan selama jam sekolah, dari saat sekolah dibuka hingga ditutup. Namun, proses pendistribusian buku saat ini belum menggunakan strategi distribusi yang efektif, sehingga menghasilkan rute distribusi yang kurang optimal. Tujuan dari penelitian ini adalah untuk menangani masalah distribusi dengan menggunakan algoritma branch and bound untuk mengoptimalkan distribusi buku melalui metode travelling salesman problem. Setelah mengimplementasikan algoritma branch and bound, jarak rute awal yang semula 75,63 km menjadi 65,34 km, sehin

APA, Harvard, Vancouver, ISO, and other styles

38

Kabbaj, Mohamed Mustapha, and Afia Abdellatif El. "Adapted branch-and-bound algorithm using SVM with model selection." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 4 (2019): 2481–90. https://doi.org/10.11591/ijece.v9i4.pp2481-2490.

Full text

Abstract:

Branch-and-Bound algorithm is the basis for the majority of solving methods in mixed integer linear programming. It has been proving its efficiency in different fields. In fact, it creates little by little a tree of nodes by adopting two strategies. These strategies are variable selection strategy and node selection strategy. In our previous work, we experienced a methodology of learning branch-and-bound strategies using regression-based support vector machine twice. That methodology allowed firstly to exploit information from previous executions of Branch-and-Bound algorithm on other instance

APA, Harvard, Vancouver, ISO, and other styles

39

Li, Hongming, and Xintao Li. "A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy." Mathematics 10, no. 24 (2022): 4705. http://dx.doi.org/10.3390/math10244705.

Full text

Abstract:

Motivated by the call of the International Maritime Organization to meet the emission targets of 2030, this study considers two important practical aspects of quay crane scheduling: efficiency and energy consumption. More precisely, we introduce the bi-objective quay crane scheduling problem where the objective is to minimize the vessel’s completion time and the crane’s energy consumption. This is done by formulating a bi-objective mixed-integer programming model. A branch-and-bound algorithm was developed as the exact solution approach to find the full set of Pareto-optimal solutions. We cons

APA, Harvard, Vancouver, ISO, and other styles

40

Andini, Qonita Putri, and Ismail Husein. "Optimization of Dimsum Production Profits Using the Branch and Bound Method." Sinkron 8, no. 3 (2024): 2107–15. http://dx.doi.org/10.33395/sinkron.v8i3.14026.

Full text

Abstract:

The dimsum industry in Indonesia is currently experiencing very significant development, because many businesses offer processed dimsum products for convenient consumption. The characteristics of dimsum are varied and suitable to be served as a snack. This has created an increasing number of dimsum enthusiasts, seen from the emergence of restaurants serving dimsum menus originating from China. The aim of this research is to determine the maximum profit achieved in making dimsum using the Branch and Bound technique. Using the branch and bound method because it is a mathematical model which is a

APA, Harvard, Vancouver, ISO, and other styles

41

Quinn, Michael J., and Narsingh Deo. "An upper bound for the speedup of parallel best-bound branch-and-bound algorithms." BIT 26, no. 1 (1986): 35–43. http://dx.doi.org/10.1007/bf01939360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Rácz, Attila. "Determining Initial Bound by "Ray-method" in Branch and Bound Procedure." Acta Cybernetica 19, no. 1 (2009): 135–46. http://dx.doi.org/10.14232/actacyb.19.1.2009.9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Li, Shuolin, Chu-Min Li, Jordi Coll, Djamal Habet, and Felip Manyà. "Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 11 (2025): 11272–81. https://doi.org/10.1609/aaai.v39i11.33226.

Full text

Abstract:

The MaxSAT problem is an optimization version of the satisfiability problem (SAT). A tight lower bound (LB) on the number of falsified soft clauses in a MaxSAT solution is crucial for the efficiency of Branch-and-Bound (BnB) MaxSAT solvers. To compute an LB, modern BnB solvers detect disjoint inconsistent subsets of soft clauses, called cores, using unit propagation. A notable feature of these solvers is that soft clauses belonging to already detected cores cannot be reused to detect additional cores, limiting the number of cores that can be detected. In this paper, we propose an unlocking mec

APA, Harvard, Vancouver, ISO, and other styles

44

Baravykaitė, Milda. "Lygiagrečiųjų šakų ir rėžių algoritmų programų kūrimas." Lietuvos matematikos rinkinys 44 (December 17, 2004): 220–25. http://dx.doi.org/10.15388/lmr.2004.31612.

Full text

Abstract:

The aim of this work is to propose parallel branch and bound algorithm template. For this purpose sequential template is introduced. Implementing additional features of this template some parallel branch and bound algorithms are comstructed and analyzed template.

APA, Harvard, Vancouver, ISO, and other styles

45

Anstreicher, Kurt M. "Efficient Solution of Maximum-Entropy Sampling Problems." Operations Research 68, no. 6 (2020): 1826–35. http://dx.doi.org/10.1287/opre.2019.1962.

Full text

Abstract:

Maximum-entropy sampling is a difficult nonlinear discrete optimization problem that arises in spatial statistics, for example, in the design of weather-monitoring networks. An exact algorithm for maximum-entropy sampling was first described in 1995, and subsequent papers have devised a variety of methods that obtain bounds and, in some cases, exact solutions. In “An Efficient Algorithm for Maximum-Entropy Sampling,” Anstreicher describes a new bound for the maximum-entropy sampling problem that is superior to all previously known bounds and is also efficiently computable. A branch-and-bound a

APA, Harvard, Vancouver, ISO, and other styles

46

Li, Xuelian, Yan Wang, and Chuansong Zhang. "Synthesis of the Large-Scaled 64 × 64 Thinned Array Using the Branch and Bound Technique with Convex Optimization for Satellite Communication." Electronics 14, no. 1 (2024): 23. https://doi.org/10.3390/electronics14010023.

Full text

Abstract:

This paper presents the synthesis of a 64 × 64 thinned array, using the branch and bound technique with convex optimization and a low sidelobe level for satellite communication. The branch and bound technology decomposes optimization into several subproblems. The convex optimization transforms the optimized variable binary [0, 1] of the thinned array into a continuous variable, i.e., from 0 to 1. Based on the branch and bound technique with convex optimization, the fast and accurate convergence of the synthesis of large-scale thinned array was achieved, and 2400 elements were selected for a fu

APA, Harvard, Vancouver, ISO, and other styles

47

Supatimah, Sri Siti, Farida Farida, and Siska Andriani. "Optimasi keuntungan dengan metode Branch and Bound." AKSIOMA : Jurnal Matematika dan Pendidikan Matematika 10, no. 1 (2019): 13–23. http://dx.doi.org/10.26877/aks.v10i1.3145.

Full text

Abstract:

Sentral Me Laundry is one of the service services businesses established in 2016 and has 2 employees having their address at Jalan pulau Ambon, Sukarame, Bandar Lampung. The development of laundry services in the middle of the city community indicates that laundry businesses can still develop and can achieve optimal profits. The purpose of this study was to find the optimal benefits obtained by the Sentral Me Laundry business. Errors in planning a laundry business result in a maximum profit. To prevent mistakes in planning a laundry business, it is necessary to use the right method. Banch And

APA, Harvard, Vancouver, ISO, and other styles

48

Marelj, Marijana. "Bound-Variable Anaphora and Left Branch Condition." Syntax 14, no. 3 (2011): 205–29. http://dx.doi.org/10.1111/j.1467-9612.2011.00156.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Lai, Ten-Hwang, and Alan Sprague. "Performance of parallel branch-and-bound algorithms." IEEE Transactions on Computers C-34, no. 10 (1985): 962–64. http://dx.doi.org/10.1109/tc.1985.6312201.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Ignatov, Andrei, and Andrei Gorchakov. "Tool for Simulating Branch and Bound Computations." Open Computer Science 10, no. 1 (2020): 112–16. http://dx.doi.org/10.1515/comp-2020-0115.

Full text

Abstract:

AbstractThe paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered. An algorithm of artificial tree generation is formulated according to this criterion. The process of simulator modeling is described, several computational experiments are conducted. Their results show a hyperbolic decrease trend for modeled time as the number of computational units grows, which is concluded to be similar to real systems.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!