Log in

Relevant bibliographies by topics / Méthode branch and bound / Journal articles

To see the other types of publications on this topic, follow the link: Méthode branch and bound.

Journal articles on the topic 'Méthode branch and bound'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 February 2022

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 'Méthode 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

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

2

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

3

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

4

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

5

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

6

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

7

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

8

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

9

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

10

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

11

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

12

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

13

Dorta, I., C. León, and C. Rodríguez. "Performance analysis of Branch-and-Bound skeletons." Mathematical and Computer Modelling 51, no. 3-4 (2010): 300–308. http://dx.doi.org/10.1016/j.mcm.2009.08.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Jain, Sanjay. "Branch and bound on the network model." Theoretical Computer Science 255, no. 1-2 (2001): 107–23. http://dx.doi.org/10.1016/s0304-3975(99)00158-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Appleton, Ben, and Changming Sun. "Circular shortest paths by branch and bound." Pattern Recognition 36, no. 11 (2003): 2513–20. http://dx.doi.org/10.1016/s0031-3203(03)00122-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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

17

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

18

Harris, Britton. "PLANNING AS A BRANCH AND BOUND PROCESS." Papers in Regional Science 26, no. 1 (2005): 53–63. http://dx.doi.org/10.1111/j.1435-5597.1971.tb01492.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

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

20

Kawaguchi, Tsuyoshi, Hiroshi Masuyama, and Tamotsu Maeda. "An asynchronous parallel branch-and-bound algorithm." Systems and Computers in Japan 23, no. 4 (1992): 1–13. http://dx.doi.org/10.1002/scj.4690230401.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

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

22

Huntbach, Matthew. "Parallel branch-and-bound search in Parlog." International Journal of Parallel Programming 20, no. 4 (1991): 299–314. http://dx.doi.org/10.1007/bf01408020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Nevins, Arthur J. "A branch and bound incremental conceptual clusterer." Machine Learning 18, no. 1 (1995): 5–22. http://dx.doi.org/10.1007/bf00993819.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Laursen, Per S. "Simple approaches to parallel Branch and Bound." Parallel Computing 19, no. 2 (1993): 143–52. http://dx.doi.org/10.1016/0167-8191(93)90044-l.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Tao, Yufei, Vagelis Hristidis, Dimitris Papadias, and Yannis Papakonstantinou. "Branch-and-bound processing of ranked queries." Information Systems 32, no. 3 (2007): 424–45. http://dx.doi.org/10.1016/j.is.2005.12.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Janakiram, Virendra K., Edward F. Gehringer, Dharma P. Agrawal, and Ravi Mehrotra. "A randomized parallel branch-and-bound algorithm." International Journal of Parallel Programming 17, no. 3 (1988): 277–301. http://dx.doi.org/10.1007/bf02427853.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Jansson, Christian, and Olaf Kn�ppel. "A branch and bound algorithm for bound constrained optimization problems without derivatives." Journal of Global Optimization 7, no. 3 (1995): 297–331. http://dx.doi.org/10.1007/bf01279453.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

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

29

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

30

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

31

Onishi, Katsumi, Hiroyuki Ebara, and Hideo Nakano. "Effect of the selection of branch variables in parallel branch and bound method." Electronics and Communications in Japan (Part II: Electronics) 89, no. 1 (2005): 53–62. http://dx.doi.org/10.1002/ecjb.20244.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Kariwala, Vinay, and Yi Cao. "Efficient Branch and Bound Methods for Pairing Selection." IFAC Proceedings Volumes 41, no. 2 (2008): 12935–40. http://dx.doi.org/10.3182/20080706-5-kr-1001.02187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Sepulveda, A. E. "Optimal material selection using branch and bound techniques." AIAA Journal 33, no. 2 (1995): 340–47. http://dx.doi.org/10.2514/3.12366.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Nadeem, Dr Sumit Agarwal, Dr Arif. "Branch and Bound Algorithm with Implementation of ooOPS." IOSR Journal of Mathematics 4, no. 4 (2012): 22–26. http://dx.doi.org/10.9790/5728-0442226.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

McKeown, G. P., V. J. Rayward-Smith, and H. J. Turpin. "Branch-and-bound as a higher-order function." Annals of Operations Research 33, no. 5 (1991): 379–402. http://dx.doi.org/10.1007/bf02073942.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Jin, Jian-qiu, Zhang-ye Wang, and Qun-sheng Peng. "Constrained Branch-and-Bound algorithm for image registration." Journal of Zhejiang University-SCIENCE A 6, S1 (2005): 94–99. http://dx.doi.org/10.1631/jzus.2005.as0094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

OKANO, Ryohtaro, Takashi KIDA, and Tomoyuki NAGASHIO. "On Branch and Bound Algorithm for Solving BMI." Transactions of the Society of Instrument and Control Engineers 40, no. 1 (2004): 45–53. http://dx.doi.org/10.9746/sicetr1965.40.45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Rani, Seema, and Dharmveer Singh Rajpoot. "LIS using backtracking and branch-and-bound approaches." CSI Transactions on ICT 4, no. 2-4 (2016): 87–93. http://dx.doi.org/10.1007/s40012-016-0108-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Chakroun, I., and N. Melab. "Operator-level GPU-Accelerated Branch and Bound Algorithms." Procedia Computer Science 18 (2013): 280–89. http://dx.doi.org/10.1016/j.procs.2013.05.191.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Meleis, W. M., A. E. Eichenberger, and I. D. Baev. "Scheduling superblocks with bound-based branch trade-offs." IEEE Transactions on Computers 50, no. 8 (2001): 784–97. http://dx.doi.org/10.1109/tc.2001.947007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

P, Rajarajeswari, and Maheswari D. "Travelling Salesman Problem Using Branch And Bound Technique." International Journal of Mathematics Trends and Technology 66, no. 5 (2020): 202–6. http://dx.doi.org/10.14445/22315373/ijmtt-v66i5p528.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Johnson, Roger V. "EFFICIENT MODULAR IMPLEMENTATION OF BRANCH-AND-BOUND ALGORITHMS." Decision Sciences 19, no. 1 (1988): 17–38. http://dx.doi.org/10.1111/j.1540-5915.1988.tb00251.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Parragh, Sophie N., and Fabien Tricoire. "Branch-and-Bound for Bi-objective Integer Programming." INFORMS Journal on Computing 31, no. 4 (2019): 805–22. http://dx.doi.org/10.1287/ijoc.2018.0856.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Olsson, C., F. Kahl, and M. Oskarsson. "Branch-and-Bound Methods for Euclidean Registration Problems." IEEE Transactions on Pattern Analysis and Machine Intelligence 31, no. 5 (2009): 783–94. http://dx.doi.org/10.1109/tpami.2008.131.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Bejerano, G. "Branch and bound computation of exact p-values." Bioinformatics 22, no. 17 (2006): 2158–59. http://dx.doi.org/10.1093/bioinformatics/btl357.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kondoh, Hitoshi, Fuminori Kobayashi, Shinji Hara, and Nobuo Takehira. "Parallel Branch and Bound Method Using Systematic Shuffling." IEEJ Transactions on Electronics, Information and Systems 113, no. 3 (1993): 211–18. http://dx.doi.org/10.1541/ieejeiss1987.113.3_211.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Hara, Shinji, Hitoshi Kondoh, and Takafumi Hosoi. "Acceleration Anomalies in Parallel Branch and Bound Algorithms." IEEJ Transactions on Electronics, Information and Systems 114, no. 2 (1994): 259–65. http://dx.doi.org/10.1541/ieejeiss1987.114.2_259.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Toan, Phan Thanh, and Nguyen The Loc. "A BRANCH AND BOUND ALGORITHM FOR WORKFLOW SCHEDULING." Vietnam Journal of Science and Technology 56, no. 2 (2018): 246. http://dx.doi.org/10.15625/2525-2518/56/2/10672.

Full text

Abstract:

Nowadays, people are connected to the Internet and use different Cloud solutions to store, process and deliver data. The Cloud consists of a collection of virtual servers that promise to provision on-demand computational and storage resources when needed. Workflow data is becoming an ubiquitous term in both science and technology and there is a strong need for new tools and techniques to process and analyze large-scale complex datasets that are growing exponentially. scientific workflow is a sequence of connected tasks with large data transfer from parent task to children tasks. Workflow sched

APA, Harvard, Vancouver, ISO, and other styles

49

Bunnag, Dhiranuch. "Combining Interval Branch and Bound and Stochastic Search." Abstract and Applied Analysis 2014 (2014): 1–15. http://dx.doi.org/10.1155/2014/861765.

Full text

Abstract:

This paper presents global optimization algorithms that incorporate the idea of an interval branch and bound and the stochastic search algorithms. Two algorithms for unconstrained problems are proposed, the hybrid interval simulated annealing and the combined interval branch and bound and genetic algorithm. The numerical experiment shows better results compared to Hansen’s algorithm and simulated annealing in terms of the storage, speed, and number of function evaluations. The convergence proof is described. Moreover, the idea of both algorithms suggests a structure for an integrated interval

APA, Harvard, Vancouver, ISO, and other styles

50

NEWLIN, MATTHEW P., та PETER M. YOUNG. "MIXED μ PROBLEMS AND BRANCH AND BOUND TECHNIQUES". International Journal of Robust and Nonlinear Control 7, № 2 (1997): 145–64. http://dx.doi.org/10.1002/(sici)1099-1239(199702)7:2<145::aid-rnc302>3.0.co;2-n.

Full text

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!