"Solving set covering problems using heuristics with branch and bound"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Solving set covering problems using heuristics with branch and bound	Kook Jin Nam	1984	Naval Postgraduate School
Branch and bound methods for combinatorial problems.	John D. C. Little	1966	M.I.T.]
Solving Non-standard Packing Problems by Global Optimization and Heuristics	Giorgio Fasano	2014	Springer International Publishing
Solving Elliptic Problems Using ELLPACK	John R. Rice; Ronald F. Boisvert	1985	Springer New York
Statistics With R: Solving Problems Using Real-World Data	Jenine K. Harris	January 2020	SAGE Publications, Inc
Solving Vibration Analysis Problems using MATLAB	Rao V. Dukkipati	2007	NEW AGE INTERNATIONAL (P) LIMITED, PUBLISHERS
Solving business problems using a calculator	Mildred K. Polisky	2003	Glencoe/McGraw-Hill
Solving business problems using a calculator	Mildred K. Polisky	1998	Glencoe/McGraw-Hill
A computer program for solution of sequence dependent routing problems using a branch-and-bound algorithm	Richard Alan Jackson	1970	Naval Postgraduate School
Solving Money Problems Using the Four Math Operations: Solving Money Problems Using the Four Math Operations	Barbara M. Linde	July 2004	PowerKids Press
Solving Problems with NMR Spectroscopy	Atta-ur-Rahman and Muhammad Iqbal Choudhary	1996	Academic Press
Solving agricultural problems with biotechnology	United States. Agricultural Research Service	1990	U.S. Dept. of Agriculture, Agricultural Research Service
Solving Urban Infrastructure Problems Using Smart City Technologies	John Vacca	2020	Elsevier
Solving Problems in Scientific Computing Using Maple and MATLAB®	Walter Gander; Jiri Hrebicek	4th ed. 2004	Springer Berlin Heidelberg
Solving Problems in Scientific Computing Using Maple and MATLAB®	Walter Gander; Jiri Hrebicek	2nd ed. 1995	Springer Berlin Heidelberg
Solving polynomial systems using continuation for engineering and scientific problems	Morgan, Alexander	2009	Society for Industrial and Applied Mathematics
Solving Problems in Scientific Computing Using Maple and MATLAB®	Walter Gander; Jiri Hrebicek	3rd ed. 1997	Springer Berlin Heidelberg
Solving Problems in Scientific Computing Using Maple and Matlab®	Walter Gander; Jiří Hřebíček	1993	Springer Berlin Heidelberg
A branch-and-bound algorithm for the solution of sequence dependent routing problems	Michael Joseph De Haemer	1970	Naval Postgraduate School
Solving problems	George Willard Frasier	1955	L.W. Singer Co.
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
93 Solving MINLP Problems Using Branch-and-Bound Methods		Optimization of chemical processes	Thomas F. Edgar, David. M. Himmelblau	2001	McGraw-Hill
Branch-and-bound algorithms using fuzzy heuristics for solving large-scale flow-shop scheduling problems	Jinliang Cheng; Hiroshi Kise; George Steiner; Paul Stephenson	Fuzzy Sets Based Heuristics for Optimization	José-Luis Verdegay	2003	Springer Berlin Heidelberg
Set-Covering Problems		Operations Research: Applications and Algorithms	Wayne L. Winston	2003	Duxbury Press
Solving traveling salesman problems using a parallel synchronized branch and bound algorithm	Claude G. Diderich; Marc Gengler	High-Performance Computing and Networking: International Conference and Exhibition, Brussels, Belgium, April 1996. Proceedings.	H. Liddell; A. Colbrook; Bob Hertzberger; P. Sloot	1996	Springer Berlin Heidelberg
Solving Set Covering Problem with Fireworks Explosion	Broderick Crawford; Ricardo Soto; Gonzalo Astudillo; Eduardo Olguín; Sanjay Misra	Computational Science and Its Applications – ICCSA 2016: 16th International Conference, Beijing, China, July 4-7, 2016, Proceedings, Part I	Osvaldo Gervasi; Beniamino Murgante; Sanjay Misra; Ana Maria A. C. Rocha; Carmelo M. Torre; David Taniar; Bernady O. Apduhan; Elena Stankova; Shangguang Wang	1st ed. 2016	Springer International Publishing
95 Solving Knapsack Problems by the Branch-and-Bound Method		Operations Research: Applications and Algorithms	Wayne L. Winston	2003	Duxbury Press
93 Solving Integer Programs: Branch and Bound		Mathematics of Optimization: How to do Things Faster	Miller S.J.	2017	American Mathematical Society
93 Solving Integer Programs: Branch and Bound		Mathematics of Optimization: How to do Things Faster	Steven J. Miller	2017	American Mathematical Society
Interpolation with 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.
Set Covering, Packing and Partitioning Problems	Karla Hoffman; Manfred Padberg	Encyclopedia of Optimization	Christodoulos A. Floudas; Panos M. Pardalos	2001	Springer US
Set Covering, Packing and Partitioning Problems	Karla Hoffman; Manfred Padberg	Encyclopedia of Optimization	Christodoulos A. Floudas; Panos M. Pardalos	2nd ed. 2009	Springer US
Set Covering, Packing, and Partitioning Problems	Joseph Geunes	Operations Planning: Mixed Integer Optimization Models	Joseph Geunes	2014	Routledge
Set Covering, Packing and Partitioning Problems		Reference Encyclopedia of Optimization		2009	Springer
96 Solving Combinatorial Optimization Problems by the Branch-and-Bound Method		Operations Research: Applications and Algorithms	Wayne L. Winston	2003	Duxbury Press
86 Regular set covering problems		Boolean Functions: Theory, Algorithms, and Applications.	Yves Crama, Peter L. Hammer	2011	Cambridge University Press
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
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Solving set covering problems using heuristics with branch and bound" - similar Books and Chapters