Journal articles on the topic 'Method of «branch and bound»'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Method of «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.
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 (April 27, 2016): 5964–74. http://dx.doi.org/10.24297/jam.v12i3.494.
Full textRá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 textKondoh, 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 textTseng, C. H., L. W. Wang, and S. F. Ling. "Enhancing Branch-and-Bound Method for Structural Optimization." Journal of Structural Engineering 121, no. 5 (May 1995): 831–37. http://dx.doi.org/10.1061/(asce)0733-9445(1995)121:5(831).
Full textTarray, Tanveer Ahmad, and Muzafar Rasool Bhat. "New Mathematical Strategy Using Branch and Bound Method." Journal of Multiscale Modelling 08, no. 02 (May 4, 2017): 1750005. http://dx.doi.org/10.1142/s1756973717500056.
Full textBelyi, B. M. "Branch-and-bound method for inherited choice functions." Cybernetics 22, no. 5 (1987): 658–63. http://dx.doi.org/10.1007/bf01068363.
Full textKariwala, Vinay, and Yi Cao. "Branch and bound method for multiobjective pairing selection." Automatica 46, no. 5 (May 2010): 932–36. http://dx.doi.org/10.1016/j.automatica.2010.02.014.
Full textWu, Shiquan. "A branch bound method for subset sum problem." Acta Mathematicae Applicatae Sinica 10, no. 3 (July 1994): 302–14. http://dx.doi.org/10.1007/bf02006860.
Full textOnishi, 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 textKariwala, Vinay, and Yi Cao. "Bidirectional Branch and Bound Method for Selecting Controlled Variables." IFAC Proceedings Volumes 42, no. 11 (2009): 625–30. http://dx.doi.org/10.3182/20090712-4-tr-2008.00101.
Full textDudek-dyduch, E. "Control of Discrete Event Processes - Branch and Bound Method." IFAC Proceedings Volumes 25, no. 18 (August 1992): 187–92. http://dx.doi.org/10.1016/s1474-6670(17)49968-x.
Full textITO, Shuji, Shinji HARA, and Kohei MORI. "BMI Optimization by a Probabilistic Branch and Bound Method." Transactions of the Society of Instrument and Control Engineers 37, no. 7 (2001): 684–86. http://dx.doi.org/10.9746/sicetr1965.37.684.
Full textYamanaka, Shota, and Masao Fukushima. "A branch-and-bound method for absolute value programs." Optimization 63, no. 2 (January 24, 2012): 305–19. http://dx.doi.org/10.1080/02331934.2011.644289.
Full textRouillon, Stéphane, Guy Desaulniers, and François Soumis. "An extended branch-and-bound method for locomotive assignment." Transportation Research Part B: Methodological 40, no. 5 (June 2006): 404–23. http://dx.doi.org/10.1016/j.trb.2005.05.005.
Full textTODOROKI, Akira. "stacking Sequence Optimizations using Fractal Branch and Bound Method." Reference Collection of Annual Meeting 2004.8 (2004): 71–72. http://dx.doi.org/10.1299/jsmemecjsm.2004.8.0_71.
Full textЛапшина, Marina Lapshina, Ковальчук, and I. Kovalchuk. "SOLVING INTEGER TRANSPORTATION PROBLEM SPECIAL BRANCH AND BOUND METHOD." Modeling of systems and processes 8, no. 4 (May 11, 2016): 44–46. http://dx.doi.org/10.12737/19520.
Full textCao, Yi, and Prabirkumar Saha. "Improved branch and bound method for control structure screening." Chemical Engineering Science 60, no. 6 (March 2005): 1555–64. http://dx.doi.org/10.1016/j.ces.2004.10.025.
Full textSergienko, I. V., Ol O. Iemets, and Ol O. Yemets. "Optimization Problems with Interval Uncertainty: Branch and Bound Method." Cybernetics and Systems Analysis 49, no. 5 (September 2013): 673–83. http://dx.doi.org/10.1007/s10559-013-9554-8.
Full textNorkin, Vladimir I., Georg Ch Pflug, and Andrzej Ruszczyński. "A branch and bound method for stochastic global optimization." Mathematical Programming 83, no. 1-3 (January 1998): 425–50. http://dx.doi.org/10.1007/bf02680569.
Full textJiao, 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 textKostyuk, Yu L. "The travelling salesman problem: improved lower bound in the branch-and-bound method." Prikladnaya diskretnaya matematika, no. 22 (December 1, 2013): 73–81. http://dx.doi.org/10.17223/20710410/22/8.
Full textPaulavičius, Remigijus, and Julius Žilinskas. "INFLUENCE OF LIPSCHITZ BOUNDS ON THE SPEED OF GLOBAL OPTIMIZATION." Technological and Economic Development of Economy 18, no. 1 (April 10, 2012): 54–66. http://dx.doi.org/10.3846/20294913.2012.661170.
Full textSupatimah, Sri Siti, Farida Farida, and Siska Andriani. "Optimasi keuntungan dengan metode Branch and Bound." AKSIOMA : Jurnal Matematika dan Pendidikan Matematika 10, no. 1 (July 23, 2019): 13–23. http://dx.doi.org/10.26877/aks.v10i1.3145.
Full textHendel, Gregor, Daniel Anderson, Pierre Le Bodic, and Marc E. Pfetsch. "Estimating the Size of Branch-and-Bound Trees." INFORMS Journal on Computing 34, no. 2 (March 2022): 934–52. http://dx.doi.org/10.1287/ijoc.2021.1103.
Full textTODOROKI, Akira, and Takashi SHINODA. "3309 Method to maximize laminate strength by fractal branch and bound method." Proceedings of the JSME annual meeting 2008.7 (2008): 185–86. http://dx.doi.org/10.1299/jsmemecjo.2008.7.0_185.
Full textMikhailyuk, V. A. "Solving Knapsack Problem: Postoptimality Analysis and Branch and Bound Method." Journal of Automation and Information Sciences 43, no. 11 (2011): 48–56. http://dx.doi.org/10.1615/jautomatinfscien.v43.i11.50.
Full textIemets, Oleg A., Alexandra O. Yemets, and Tatyana A. Parfonova. "Branch and Bound Method for Optimization Problems on Fuzzy Sets." Journal of Automation and Information Sciences 45, no. 4 (2013): 23–29. http://dx.doi.org/10.1615/jautomatinfscien.v45.i4.30.
Full textABE, Keisuke, and Shinji ARAYA. "Optimization of Train Order by the Branch and Bound Method." Transactions of the Society of Instrument and Control Engineers 21, no. 5 (1985): 514–21. http://dx.doi.org/10.9746/sicetr1965.21.514.
Full textBennaceur, Hachemi, Idir Gouachi, and Gérard Plateau. "An Incremental Branch-and-Bound Method for the Satisfiability Problem." INFORMS Journal on Computing 10, no. 3 (August 1998): 301–8. http://dx.doi.org/10.1287/ijoc.10.3.301.
Full textEckstein, Jonathan, and Noam Goldberg. "An Improved Branch-and-Bound Method for Maximum Monomial Agreement." INFORMS Journal on Computing 24, no. 2 (May 2012): 328–41. http://dx.doi.org/10.1287/ijoc.1110.0459.
Full textAL-QATTAN, IBRAHIM. "Designing flexible manufacturing cells using a branch and bound method." International Journal of Production Research 28, no. 2 (February 1990): 325–36. http://dx.doi.org/10.1080/00207549008942714.
Full textLau, M. S. K., Wuyi Yue, Peng Wang, and Li Ping. "A Branch-and-Bound Method for Power Minimization of IDMA." IEEE Transactions on Vehicular Technology 57, no. 6 (November 2008): 3525–37. http://dx.doi.org/10.1109/tvt.2008.919617.
Full textBo, Tian, and Posypkin Mikhail. "Efficient Implementation of Branch-and-bound Method on Desktop Grids." Computer Science 15, no. 3 (2014): 239. http://dx.doi.org/10.7494/csci.2014.15.3.239.
Full textFeng, Z. G., K. L. Teo, and Y. Zhao. "Branch and bound method for sensor scheduling in discrete time." Journal of Industrial & Management Optimization 1, no. 4 (2005): 499–512. http://dx.doi.org/10.3934/jimo.2005.1.499.
Full textKwanyuen, Bancha, and Darrell G. Fontane. "Heuristic Branch-and-Bound Method for Ground Water Development Planning." Journal of Water Resources Planning and Management 124, no. 3 (May 1998): 140–48. http://dx.doi.org/10.1061/(asce)0733-9496(1998)124:3(140).
Full textLi, Caijuan, Limin Wang, Guizhen Hao, and Hongliang Zhang. "Drainage Pipe Network Optimization Design Based on Branch-bound Method." Journal of Applied Sciences 13, no. 22 (November 1, 2013): 5503–7. http://dx.doi.org/10.3923/jas.2013.5503.5507.
Full textKariwala, Vinay, Lingjian Ye, and Yi Cao. "Branch and bound method for regression-based controlled variable selection." Computers & Chemical Engineering 54 (July 2013): 1–7. http://dx.doi.org/10.1016/j.compchemeng.2013.03.006.
Full textMelnikov, Boris, and Elena Melnikova. "On the Classical Version of the Branch and Bound Method." Computer Tools in Education, no. 1 (March 28, 2021): 21–44. http://dx.doi.org/10.32603/2071-2340-2021-1-21-45.
Full textZHANG, BIN, and BO CHEN. "HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM." Asia-Pacific Journal of Operational Research 29, no. 05 (October 2012): 1250031. http://dx.doi.org/10.1142/s0217595912500315.
Full textMarulizar, Tondi, Ujian Sinulingga, and Esther Nababan. "Optimisasi Program Linear Integer Murni Dengan Metode Branch And Bound." Talenta Conference Series: Science and Technology (ST) 1, no. 2 (December 20, 2018): 175–81. http://dx.doi.org/10.32734/st.v1i2.295.
Full textIgnatov, Andrei, and Andrei Gorchakov. "Tool for Simulating Branch and Bound Computations." Open Computer Science 10, no. 1 (May 13, 2020): 112–16. http://dx.doi.org/10.1515/comp-2020-0115.
Full textKurniawati, Dwi Agustina. "Penjadwalan Produksi Flow Shop untuk Meminimalkan Makespan dengan Metode Pour, Pemrograman Dinamis dan Branch and Bound di CV. Bonjor Jaya." JURNAL TEKNIK INDUSTRI 9, no. 2 (July 16, 2009): 63–70. http://dx.doi.org/10.25105/jti.v9i2.4920.
Full textBelyi, Alexander B., Stanislav L. Sobolevsky, Alexander N. Kurbatski, and Carlo Ratti. "Improved upper bounds in clique partitioning problem." Journal of the Belarusian State University. Mathematics and Informatics, no. 3 (November 29, 2019): 93–104. http://dx.doi.org/10.33581/2520-6508-2019-3-93-104.
Full textBaravykaite, M., R. Čiegis, and J. Žilinskas. "TEMPLATE REALIZATION OF GENERALIZED BRANCH AND BOUND ALGORITHM." Mathematical Modelling and Analysis 10, no. 3 (September 30, 2005): 217–36. http://dx.doi.org/10.3846/13926292.2005.9637283.
Full textUtama, Dana Marsetiya. "Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan." PROZIMA (Productivity, Optimization and Manufacturing System Engineering) 2, no. 1 (June 25, 2019): 20. http://dx.doi.org/10.21070/prozima.v2i1.1527.
Full textSURYAWAN, GEDE, NI KETUT TARI TASTRAWATI, and KARTIKA SARI. "PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI." E-Jurnal Matematika 5, no. 4 (November 30, 2016): 148. http://dx.doi.org/10.24843/mtk.2016.v05.i04.p134.
Full textAdelgren, Nathan, and Akshay Gupte. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming." INFORMS Journal on Computing 34, no. 2 (March 2022): 909–33. http://dx.doi.org/10.1287/ijoc.2021.1092.
Full textSuyudi, Mochamad, Ismail Bin Mohd, Mustafa Mamat, Sudrajat Sopiyan, and Asep K. Supriatna. "Solution of maximum clique problem by using branch and bound method." Applied Mathematical Sciences 8 (2014): 81–90. http://dx.doi.org/10.12988/ams.2014.310601.
Full textCao, Yi, Diane Rossiter, and David H. Owens. "Globally Optimal Control Structure Selection Using Branch and Bound Method 1." IFAC Proceedings Volumes 31, no. 11 (June 1998): 185–90. http://dx.doi.org/10.1016/s1474-6670(17)44926-3.
Full textKurashige, Kenji, Yoshinari Yanagawa, and Shigeji Miyazaki. "Application of Branch and Bound Method in Divided Line Balancing Problem." Journal of the Japan Society for Precision Engineering 62, no. 5 (1996): 691–95. http://dx.doi.org/10.2493/jjspe.62.691.
Full text