"Branch and Bound for Global NLP: New Bounding LP"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
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.
Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications	Daniel Scholz	2012	Springer New York
A branch and bound method for nonseparable nonconvex optimization	James K. Hartman	1975	Naval Postgraduate School
Einführung in die Methode Branch and Bound	F. Weinberg	1968	Springer Berlin Heidelberg
A branch and bound algorithm for the delivery truck problem	Stephen John Balut	1973	Naval Postgraduate School
NLP and the New Manager	Ian McDermott; Ian Shircore	December 21, 2000	Texere
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization	Stefan Rocktäschel	1st ed. 2020	Springer Fachmedien Wiesbaden
Branch-and-Bound Applications in Combinatorial Data Analysis	Michael J. Brusco; Stephanie Stahl	2005	Springer New York
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 optimal NOR networks (the algorithm description)	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
New Classes of Lp-Spaces	Jean Bourgain	1981	Springer Berlin Heidelberg
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
NLP for Rookies	Rebecca Mallery, Katherine Russell	2009	Marshall Cavendish International (Asia) Private Limited
A branch-and-bound algorithm for the solution of sequence dependent routing problems	Michael Joseph De Haemer	1970	Naval Postgraduate School
NLP Made Easy,New Edition	Carol Harris	July 25, 2003	Element Books Ltd.
Pruning and branching methods for designing optimal networks by the branch-and-bound method	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
Solving set covering problems using heuristics with branch and bound	Kook Jin Nam	1984	Naval Postgraduate School
On the computational complexity of branch and bound search strategies	Douglas R. Smith	1979	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
Branch and Bound for Global NLP: New Bounding LP	Thomas G. W. Epperly; Ross E. Swaney	Global Optimization in Engineering Design	Ignacio E. Grossmann	1996	Springer US
Branch and Bound for Global NLP: Iterative LP Algorithm & Results	Thomas G. W. Epperly; Ross E. Swaney	Global Optimization in Engineering Design	Ignacio E. Grossmann	1996	Springer US
92 Branch-and-Bound Methods Using LP Relaxations		Optimization of chemical processes	Thomas F. Edgar, David. M. Himmelblau	2001	McGraw-Hill
93 Branch and Bound Algorithm for Mixed Integers (LP-based)		Optimization concepts and applications in engineering	Belegundu, Ashok D.; Chandrupatla, Tirupathi R	2019	Cambridge University Press
93 Branch and Bound Algorithm for Mixed Integers (LP-based)		Optimization Concepts and Applications in Engineering	Ashok D. Belegundu, Tirupathi R. Chandrupatla	2019	Cambridge University Press
93 Branch and Bound Algorithm for Mixed Integers (LP-Based)		Optimization Concepts and Applications in Engineering, Second Edition	Ashok D. Belegundu, Tirupathi R. Chandrupatla	2011	Cambridge University Press
Distributed Branch and Bound Algorithms for Global Optimization	Ioannis P. Androulakis; Christodoulos A. Floudas	Parallel Processing of Discrete Problems	Panos M. Pardalos	1999	Springer New York
92 Tabling, LP, and NLP		Declarative Logic Programming: Theory, Systems, and Applications	Michael Kifer and Yanhong Annie Liu	2018	Association for Computing Machinery and Morgan & Claypool Publishers
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
Branch And Bound	Saul I. Gass; Carl M. Harris	Encyclopedia of Operations Research and Management Science	Saul I. Gass; Carl M. Harris	2nd ed. 2001	Springer US
Branch and Bound		Essential algorithms: a practical approach to computer algorithms using Python and C#	Rod Stephens	2019	John Wiley & Sons
Branch and Bound		Essential algorithms: a practical approach to computer algorithms using Python and C#	Stephens, Rod	2019	Wiley
BRANCH-AND-BOUND		Problem Solving in Data Structures & Algorithms Using C#	Hemant Jain	2018
Branch and Bound		Algorithms for Decision Making	Mykel J. Kochenderfer; Tim A. Wheeler; Kyle H. Wray	2020
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Branch and Bound for Global NLP: New Bounding LP" - similar Books and Chapters