"A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
A branch-and-bound algorithm for optimal NOR networks (the algorithm description)	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
A branch and bound algorithm for the delivery truck problem	Stephen John Balut	1973	Naval Postgraduate School
Pruning and branching methods for designing optimal networks by the branch-and-bound method	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization	Stefan Rocktäschel	1st ed. 2020	Springer Fachmedien Wiesbaden
A branch and bound algorithm for integer and mixed-integer linear programs	Joseph Bannan Missal	1969	Naval Postgraduate School
A branch-and-bound algorithm for the solution of sequence dependent routing problems	Michael Joseph De Haemer	1970	Naval Postgraduate School
A group theoretic branch and bound algorithm for the zero-one integer programming problem	Jeremy F. Shapiro	1967	M.I.T.]
Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program	Jay Culliney	1976	Dept. of Computer Science, University of Illinois at Urbana-Champaign
A computer program for solution of sequence dependent routing problems using a branch-and-bound algorithm	Richard Alan Jackson	1970	Naval Postgraduate School
A branch and exclude algorithm for the knapsack problem	Robert Lawrence Hegerich	1968	Naval Postgraduate School;Available from National Technical Information Service
An investigation of several branching functions in a branch and bound algorithm for the chromatic number problem	Ronald E. Rautenberg	1980	Naval Postgraduate School
An optimal parallel algorithm for selection.	U. Vishkin	1983	Courant Institute of Mathematical Sciences, New York University
An optimal parallel algorithm for selection	U. Vishkin	1983	Courant Institute of Mathematical Sciences, New York University
An optimal selection algorithm.	Richard Cole	1986	Courant Institute of Mathematical Sciences, New York University
An optimal selection algorithm	Richard Cole	1986	Courant Institute of Mathematical Sciences, New York University
Branch-and-bound strategies for dynamic programming	Thomas L. Morin	1975	Alfred P. Sloan School of Management, Massachusetts Institute of Technology
Branch and bound methods for combinatorial problems.	John D. C. Little	1966	M.I.T.]
Branch-and bound strategies for dynamic programming	Thomas L. Morin	1974	M.I.T.
An iteration algorithm for optimal network flows	Chang Joon Woong	1983	Naval Postgraduate School
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
A Depth-First Branch and Bound Algorithm for Learning Optimal Bayesian Networks	Brandon Malone; Changhe Yuan	Graph Structures for Knowledge Representation and Reasoning: Third International Workshop, GKR 2013, Beijing, China, August 3, 2013. Revised Selected Papers	Madalina Croitoru; Sebastian Rudolph; Stefan Woltran; Christophe Gonzales	2014	Springer International Publishing
A Branch-and-Bound Algorithm	Ulrich Dorndorf	Project Scheduling with Time Windows: From Theory to Applications	Ulrich Dorndorf	2002	Physica-Verlag HD
A Branch and Bound Algorithm	Arno Sprecher	Resource-Constrained Project Scheduling: Exact Methods for the Multi-Mode Case	Arno Sprecher	1994	Springer Berlin Heidelberg
A Branch-and-Bound Algorithm	Toàn Phan Huy	Constraint Propagation in Flexible Manufacturing	Toan Phan Huy	2000	Springer Berlin Heidelberg
Branch-and-bound algorithm		The Cambridge Dictionary of Statistics	B. S. Everitt, A. Skrondal	2010	Cambridge University Press
Branch-and-bound algorithm:		The Cambridge Dictionary of Statistics	B. S. Everitt	2006	Cambridge University Press
branch and bound algorithm		A Dictionary of Computer Science (Oxford Quick Reference)	Andrew Butterfield (editor), Gerard Ekembe Ngondi (editor), Anne Kerr (editor)	2016	Oxford University Press
Branch-and-bound algorithm		The Cambridge dictionary of statistics	Brian Everitt; Anders Skrondal	2010	Cambridge University Press
The branch-and-bound algorithm		Optimization Methods in Finance (Mathematics, Finance and Risk)	Gerard Cornuejols, Reha Tutuncu,	2007	Cambridge University Press
A Distributed Branch-and-Bound Algorithm for Computing Optimal Coalition Structures	Chattrakul Sombattheera; Aditya Ghose	Advances in Artificial Intelligence: 4th Helenic Conference on AI, SETN 2006, Heraklion, Crete, Greece, May 18-20, 2006, Proceedings	Grigoris Antoniou; George Potamias; Costas Spyropoulos; Dimitris Plexousakis	2006	Springer Berlin Heidelberg
A Branch-and-bound Algorithm for Boolean Regression	Iwin Leenen; Iven Van Mechelen	Classification, Data Analysis, and Data Highways: Proceedings of the 21st Annual Conference of the Gesellschaft für Klassifikation e. V. , University of Potsdam, March 12–14, 1997	Ingo Balderjahn; Rudolf Mathar; Martin Schader	1998	Springer Berlin Heidelberg
A basic Branch-and-Bound algorithm for (MOMICP)	Stefan Rocktäschel	A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization	Stefan Rocktäschel	1st ed. 2020	Springer Fachmedien Wiesbaden
18 Branch-And-Bound Algorithm		Computer Science, Algorithms and Complexity	Adele Kuzmiakova	2020	Arcler Press
412 Branch-and-Bound Algorithm		Steiner tree problems in computer communication networks	Dingzhu Du, Xiaodong Hu	2008	World Scientific
A Parallel Branch–and–Bound Algorithm for Computing Optimal Task Graph Schedules	Udo Hönig; Wolfram Schiffmann	Grid and Cooperative Computing: Second International Workshop, GCC 2003, Shanghai, China, December 7-10, 2003, Revised Papers, Part II	Minglu Li; Xian-He Sun; Qianni Deng; Jun Ni	2004	Springer Berlin Heidelberg
A Depth-First Branch and Bound Algorithm for Learning Optimal Bayesian Networ		Graph Structures for Knowledge Representation and Reasoning: Third International Workshop, GKR 2013, Beijing, China, August 3, 2013. Revised Selected Papers	Patrice Buche, Virginie Cucheval (auth.), Madalina Croitoru, Sebastian Rudolph, Stefan Woltran, Christophe Gonzales (eds.)	2014	Springer International Publishing
The geometric branch-and-bound algorithm	Daniel Scholz	Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications	Daniel Scholz	2012	Springer New York
The Branch-and-Bound Algorithm (Optional)		Spreadsheet Modeling and Decision Analysis: A Practical Introduction to Management Science, Revised (Book Only)	Cliff Ragsdale	2007	South-Western College Pub
Parallel Algorithm Design for Branch and Bound	David A. Bader; William E. Hart; Cynthia A. Phillips	Tutorials on Emerging Methodologies and Applications in Operations Research: Presented at INFORMS 2004, Denver, CO	Harvey J. Greenberg	2005	Springer New York
Genetic Branch-and-Bound or Exact Genetic Algorithm?	Cédric Pessan; Jean-Louis Bouquard; Emmanuel Néron	Artificial Evolution: 8th International Conference, Evolution Artificielle, EA 2007 Tours, France, October 29-31, 2007, Revised Selected Papers	Nicolas Monmarché; El-Ghazali Talbi; Pierre Collet; Marc Schoenauer; Evelyne Lutton	2008	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)" - similar Books and Chapters