"Pruning and branching methods for designing optimal networks by the branch-and-bound method"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
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 optimal NOR networks (the algorithm description)	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
Branch and bound methods for combinatorial problems.	John D. C. Little	1966	M.I.T.]
Designing optimal protected area networks	Alain Billionnet	2021	EDP Sciences
A branch and bound method for nonseparable nonconvex optimization	James K. Hartman	1975	Naval Postgraduate School
Computer program for designing optimal networks with MOS gates	Teruaki Shinozaki	1972	Dept. of Computer Science, University of Illinois at Urbana-Champaign
Comparison of the implicit enumeration method and the branch-and-bound method for logical design	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
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
An investigation of several branching functions in a branch and bound algorithm for the chromatic number problem	Ronald E. Rautenberg	1980	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.
Solution of three related combinatorial problems by network-flow and "branch and bound" methods	Christopher R. Sprague	1970	M.I.T.]
White pine pruning and branch growth	Thomas W. McConkey	1965	Northeastern Forest Experiment Station, Forest Service, U. S. Dept. of Agriculture
Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications	Daniel Scholz	2012	Springer New York
Rounded [i. e. Bounded] branch and bound method for mixed integer nonlinear programming problems	Jacob Akoka	1977	M.I.T. Alfred P. Sloan School of Management
Microcirculation in Fractal Branching Networks	Tatsuhisa Takahashi	2014	Springer Japan
Designing Optimal Strategies for Mineral Exploration	J.G. De Geoffroy; T.K. Wignall	1985	Springer US
A study of certain factors affecting computation times in designing optimal NOR networks by the implicit enumeration method using the feed-forward formulation	Jay Culliney	1976	Dept. of Computer Science, University of Illinois at Urbana-Champaign
A branch and bound algorithm for the delivery truck problem	Stephen John Balut	1973	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
Branching Schemes for Branch-and-Bound	Emmanuel Néron	Resource-constrained Project Scheduling	Christian Artigues	2008	John Wiley & Sons
Branch-and-Bound Method		Operations Research: Applications and Algorithms	Wayne L. Winston	2003	Duxbury Press
Branch And Bound Method		The Concise Oxford Dictionary of Mathematics (Oxford Quick Reference)	Richard Earl, James Nicholson	2021	Oxford University Press
Branch and Bound Method		The operations research problem solver	The Staff of REA	1983	Research & Education Association
BRANCH-AND-BOUND METHOD		Encyclopedia of Statistical Sciences	Campbell B. Read, N. Balakrishnan, Brani Vidakovic, Samuel Kotz	2005	Wiley-Interscience
Branch and bound methods		Constrained Global Optimization: Algorithms and Applications	Panos M. Pardalos; J. Ben Rosen	1987	Springer Berlin Heidelberg
Branch and Bound Methods	H. A. Eiselt; C.-L. Sandblom	Integer Programming and Network Models	H.A. Eiselt; Carl-Louis Sandblom	2000	Springer Berlin Heidelberg
Branch-and-Bound Methods	Stanisław Walukiewicz	Integer Programming	Stanislav Walukiewicz	1991	Springer Netherlands
Branch and bound methods	T.A.J. Nicholson	Optimization in Industry: Volume 1, Optimization Techniques	T.A.J. Nicholson	1971	Routledge
Branch-and-Bound Methods	Hamdy A. Taha	Integer Programming	Hamdy A. Taha and J. William Schmidt	1975	Academic Press
Branch and bound methods		Inferring Phylogenies	Joseph Felsenstein	2004	Sinauer Associates
Branch-and-Bound Methods		Optimization Algorithms in Physics	Alexander H. Hartmann	2002	John Wiley & Sons
Branch-and-Bound Methods	Iréne Charon; Olivier Hudry	Concepts of Combinatorial Optimization, 2nd Edition	Vangelis Th Paschos	2014	John Wiley & Sons
Branch-and-Bound Methods	Irène Charon; Olivier Hudry	Concepts of Combinatorial Optimization: Concepts and Fundamentals - Volume 1	Vangelis Th Paschos	2010	John Wiley & Sons
The Branch-and-Bound Method	Palle Thoft-Christensen; Yoshisada Murotsu	Application of Structural Systems Reliability Theory	Palle Thoft-Christensen; Yoshisada Murotsu	1986	Springer Berlin Heidelberg
76 Branch and Bound Method		Operations research: theory and applications	J. K. Sharma	2016	Trinity
106 Branch-and-Bound Method		Engineering Optimization: Theory and Practice	Singiresu S. Rao	1996	Wiley-Interscience
62 Branch-and-bound method		OCR A Level Further Mathematics Discrete	NICK. GEERE	2018	Hodder Education
54 Branch and Bound Method		Operations Research	Jha	2014	McGraw-Hill Education
94 Branch and Bound Method		Operations research	P Sankara Iyer	2008	Tata McGraw-Hill
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Pruning and branching methods for designing optimal networks by the branch-and-bound method" - similar Books and Chapters