"On the computational complexity of branch and bound search strategies"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
On the computational complexity of branch and bound search strategies	Douglas R. Smith	1979	Naval Postgraduate School
Branch-and-bound strategies for dynamic programming	Thomas L. Morin	1975	Alfred P. Sloan School of Management, Massachusetts Institute of Technology
Branch-and bound strategies for dynamic programming	Thomas L. Morin	1974	M.I.T.
Kolmogorov Complexity and Computational Complexity	Osamu Watanabe	1992	Springer
Kolmogorov Complexity and Computational Complexity	Osamu Watanabe	1992	Springer Berlin Heidelberg
Computational complexity /	Papadimitriou, Christos H.	1995, ©1994.	Addison-Wesley,
Computational complexity	K. Wagner; G. Wechsung	1986	Reidel Pub. Co.;Hingham, MA, U.S.A.;Distributors for the U.S.A. and Canada, Kluwer Academic Publishers
Efficient Branch and Bound Search with Application to Computer-Aided Design	Xinghao Chen, Michael L. Bushnell (auth.)	1996	Springer US
Efficient Branch and Bound Search with Application to Computer-Aided Design	Xinghao Chen; Michael L. Bushnell	1996	Springer US
Efficient branch and bound search with application to computer-aided design	Xinghao Chen	1996	Kluwer Academic Publishers
Theories of Computational Complexity	Cristian Calude (Eds.)	1988	North-Holland
Think Complexity: Complexity Science and Computational Modeling	Allen Downey	2012	"O'Reilly Media, Inc."
Analytic Computational Complexity	J. F. Traub	1976	Academic Press
Computational complexity theory /	Rudich, Steven.; Wigderson, Avi.	[2004], ©2004.	American Mathematical Society, Institute for Advanced Study,
Analytic computational complexity	Symposium on Analytic Computational Complexity Carnegie-Mellon University 1975.	1976	Academic Press
Computational Complexity of Counting and Sampling	Istvan Miklos	2019	Routledge
The Computational Complexity of Logical Theories	J. Ferrante; C. W. Rackoff	1979	Springer Berlin Heidelberg
The computational complexity of machine learning	Michael J. Kearns	1990	MIT Press
Computational Complexity and Statistical Physics	Allon Percus; Gabriel Istrate; Cristopher Moore	2005	Oxford University Press
Noisy Information and Computational Complexity	Leszek Plaskota	1996-05	Cambridge University Press
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Branch-and-Bound Search		Encyclopedia of Biometrics	Stan Z. Li	2009	Springer US
Branch-and-bound search		Algorithms and architectures of artificial intelligence	E. Tyugu	2007	IOS Press
Branch and bound search		Probabilistic ranking techniques in relational databases	Ihab F. Ilyas	2011	Morgan & Claypool
Stochastic branch and bound search		Algorithms and architectures of artificial intelligence	E. Tyugu	2007	IOS Press
132 Branch-and-Bound Search		Parallel programming: techniques and applications using networked workstations and parallel computers	Allen, C. Michael; Wilkinson, Barry	2004;2005	Pearson/Prentice Hall
A43 Branch and Bound Search		Probabilistic Graphical Models: Principles and Techniques (Adaptive Computation and Machine Learning series)	Daphne Koller, Nir Friedman	2009	The MIT Press
Computational Protein Design Using AND/OR Branch-and-Bound Search	Yichao Zhou; Yuexin Wu; Jianyang Zeng	Research in Computational Molecular Biology: 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings	Teresa M. Przytycka	2015	Springer International Publishing
A43 Branch and Bound Search 1197		Probabilistic Graphical Models: Principles and Techniques	Daphne Koller, Nir Friedman	2009	The MIT Press
Comparing two probabilistic models of the computational complexity of the branch and bound algorithm	Michèle Dion; Marc Gengler; Stéphane Ubéda	Parallel Processing: CONPAR 94 - VAPP VI: Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994. Proceedings	Bruno Buchberger; Jens Volkert	1994	Springer Berlin Heidelberg
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms	Thomas M. Breuel	Computer Vision - ECCV 2002: 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002, Proceedings, Part III	Anders Heyden; Gunnar Sparr; Mads Nielsen; Peters Johansen	2002	Springer Berlin Heidelberg
Search and Computational Complexity in IS		Intelligent systems: principles, paradigms, and pragmatics	Robert J. Schalkoff	2011	Jones and Bartlett Publishers
Optimal Base Search II: Branch and Bound		Tools and Algorithms for the Construction and Analysis of Systems. 17th International Conference, TACAS 2011 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011 Saarbrücken, Germany, March 26–April 3, 2011 Proceedings	Parosh Aziz Abdulla, K. Rustan M. Leino (eds.)	2013	Springer Nature.
11. Depth-First Branch-and-Bound Search		Optimization and computational logic /	McAloon, Kenneth.; Tretkoff, Carol.	[1996], ©1996.	Wiley,
Branch and Bound		Encyclopedia of Operations Research and Management Science	Saul I. Gass; Michael C. Fu	3rd ed. 2013	Springer US
Branch and Bound		Encyclopedia of GIS	Shashi Shekhar; Hui Xiong; Xun Zhou	2nd ed. 2017	Springer International Publishing
Branch-and-Bound	Rafael Martí; Gerhard Reinelt	The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization	Rafael Martí; Gerhard Reinelt	2011	Springer Berlin Heidelberg
Branch and Bound	Reiner Horst; Hoang Tuy	Global Optimization: Deterministic Approaches	Reiner Horst; Hoang Tuy	1990	Springer Berlin Heidelberg
Branch and Bound	Reiner Horst; Hoang Tuy	Global Optimization: Deterministic Approaches	Reiner Horst; Hoang Tuy	3rd ed. 1996	Springer Berlin Heidelberg
Branch and Bound	Shashi Shekhar; Hui Xiong	Encyclopedia of GIS	Shashi Shekhar; Hui Xiong	2008	Springer US
Branch-and-Bound	Rafael Martí; Gerhard Reinelt	Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem	Rafael Martí; Gerhard Reinelt	2nd ed. 2022	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"On the computational complexity of branch and bound search strategies" - similar Books and Chapters