Books on the topic 'Branch and bound'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books 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 books on a wide variety of disciplines and organise your bibliography correctly.
Turpin, Heather Jane. The branch-and-bound paradigm. University of East Anglia, 1990.
Find full textKedia, Pradeep. Optimal solution of set covering problems using dual heuristics. Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Management, Purdue University, 1987.
Find full textMoursli, Omar. Scheduling the hybrid flowshop: Branch and bound algorithms. CIACO, 1999.
Find full textBrusco, Michael. Branch-and-bound applications in combinatorial data analysis. Springer, 2004.
Find full textStephanie, Stahl, ed. Branch-and-bound applications in combinatorial data analysis. Springer, 2005.
Find full textG, Kiselev V., ed. Metod resheni͡ia ͡tselochislennoĭ podzadachi Bendersa v nekotorykh zadachakh razmeshcheni͡ia proizvodstva. Vychislitelʹnyĭ ͡tsentr AN SSSR, 1985.
Find full textYanai, Shūzō. On a dominance test for a single machine scheduling problem with release dates to minimize total flow time. Institute of Economic Research, Kobe University of Commerce, 2003.
Find full textChen, Xinghao, and Michael L. Bushnell. Efficient Branch and Bound Search with Application to Computer-Aided Design. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1329-8.
Full textRocktäschel, Stefan. A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization. Springer Fachmedien Wiesbaden, 2020. http://dx.doi.org/10.1007/978-3-658-29149-5.
Full textChen, Xinghao. Efficient Branch and Bound Search with Application to Computer-Aided Design. Springer US, 1996.
Find full textRush, S. A. Implementation of parallel branch-and-bound on a network of transputers. University of East Anglia, 1992.
Find full text1950-, Bushnell Michael L., ed. Efficient branch and bound search with application to computer-aided design. Kluwer Academic Publishers, 1996.
Find full textEagle, James N. An optimal branch-and-bound procedure for the constrained path, moving target search problem. Naval Postgraduate School, 1987.
Find full textHajian, Mozafar Taghi. Design, implementation and testing of an integrated branch and bound algorithm for piecewise linear and discrete programming problems within an LP framework. Brunel University, Department of Mathematics and Statistics, 1992.
Find full textSan Francisco (Calif.). Bureau of Architecture., ed. Branch library improvement program: November 2000--general obligation bond program proposal. The Bureau, 2000.
Find full textRach, Rudolf. Theater heute: Stücke von Beckett, Bernhard, Bond, Brasch, Kroetz, Müller, Norén, Strauss. Suhrkamp, 1985.
Find full textVerheul, Jaap, ed. The Cultural Life of James Bond. Amsterdam University Press, 2020. http://dx.doi.org/10.5117/9789462982185.
Full textCrainic, Teodor Gabriel, and Catherine Roucairol. Parallel Branch and Bound. John Wiley & Sons Inc, 2007.
Find full textMarsten, Roy E., Thomas L. Morin, and Sloan School of Management. Branch-And-bound Strategies for Dynamic Programming. Creative Media Partners, LLC, 2015.
Find full textMarsten, Roy E., and Thomas L. Morin. Branch-And Bound Strategies for Dynamic Programming. Creative Media Partners, LLC, 2018.
Find full textMarsten, Roy E., Thomas L. Morin, and Sloan School of Management. Branch-And-bound Strategies for Dynamic Programming. Creative Media Partners, LLC, 2018.
Find full textBranch-And-bound Strategies for Dynamic Programming. Creative Media Partners, LLC, 2023.
Find full textBranch and Bound Methods for Combinatorial Problems. Creative Media Partners, LLC, 2023.
Find full textBranch-And-bound Strategies for Dynamic Programming. Creative Media Partners, LLC, 2023.
Find full textBranch-and-Bound Applications in Combinatorial Data Analysis. Springer-Verlag, 2005. http://dx.doi.org/10.1007/0-387-28810-4.
Full textEfficient Neural Network Verification Using Branch and Bound. [publisher not identified], 2022.
Find full textPrivenau, Raoul. Branch-and-Bound-Techniken zur Lösung von BIP-Problemen. GRIN Verlag GmbH, 2009.
Find full textNetwork Interdiction by Lagrandian Relaxation and Branch-and-Bound. Storming Media, 2002.
Find full textNevelö, Sandor. GANZZAHLIGE LINEARE PROGRAMMIERUNG MIT HILFE VON BRANCH AND BOUND. GRIN Verlag GmbH, 2010.
Find full textBolouri, Maryam. Network models with generalized upper bound side constraints. 1989.
Find full textScholz, Daniel. Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications. Springer, 2011.
Find full textBushnell, Michael L. Efficient Branch and Bound Search with Application to Computer-Aided Design. Island Press, 1995.
Find full textRocktäschel, Stefan. A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization. Springer, 2020.
Find full textScholz, Daniel. Deterministic Global Optimization: Geometric Branch-And-bound Methods and Their Applications. Springer, 2014.
Find full textBranch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing). Springer New York, 2006.
Find full textDeterministic Global Optimization: Geometric Branch-And-bound Methods and Their Applications. Springer, 2011.
Find full textHailer, Angelika. Verification of Branch and Bound Algorithms applied to Water Distribution Network Design. Logos Verlag Berlin, 2006.
Find full textShapiro, Jeremy F. Group Theoretic Branch and Bound Algorithm for the Zero-One Integer Programming Problem. Creative Media Partners, LLC, 2018.
Find full textAkoka, Jacob. Rounded [I. E. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems. Creative Media Partners, LLC, 2018.
Find full textSprague, Christopher R. Solution of Three Related Combinatorial Problems by Network-Flow and Branch and Bound Methods. Creative Media Partners, LLC, 2018.
Find full textBranch and Bound : eine Einführung: Unterlagen Für Einen Kurs des Instituts Für Operations Research der ETH Zürich. Springer London, Limited, 2013.
Find full textSeparable Optimierung Durch Innere-Punkte-Methoden: Ein Ansatz Auf Der Grundlage Des Branch-And-Bound Prinzips (Europaische Hochschulschriften). Peter Lang Publishing, 2002.
Find full textEinführung in Die Methode Branch and Bound: Unterlagen Für Einen Kurs des Instituts Für Operations Research der ETH, Zürich. Springer London, Limited, 2013.
Find full textRobert F, Williams. Part III Structure of State Government, 10 The State Judicial Branch. Oxford University Press, 2009. http://dx.doi.org/10.1093/acprof:oso/9780195343083.003.0010.
Full textGregory, Richard, Sir British Science Guild. A catalogue of British scientific and technical books, covering every branch of science and technology carefully classified and indexed 1921 [Leather Bound]. Generic, 2019.
Find full textBurkart, Olaf. Automatic Verification of Sequential Infinite-State Processes. Springer London, Limited, 2003.
Find full textDavidson, Donald. The Perils and Pleasures of Interpretation. Edited by Ernest Lepore and Barry C. Smith. Oxford University Press, 2009. http://dx.doi.org/10.1093/oxfordhb/9780199552238.003.0041.
Full textKoenderink, Jan. Visual Illusions? Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199794607.003.0008.
Full text