"Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
An investigation of several branching functions in a branch and bound algorithm for the chromatic number problem	Ronald E. Rautenberg	1980	Naval Postgraduate School
A branch and bound algorithm for the delivery truck problem	Stephen John Balut	1973	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
A group theoretic branch and bound algorithm for the zero-one integer programming problem	Jeremy F. Shapiro	1967	M.I.T.]
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 exclude algorithm for the knapsack problem	Robert Lawrence Hegerich	1968	Naval Postgraduate School;Available from National Technical Information Service
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1987	Sloan School of Management, Massachusetts Institute of Technology
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1988	Sloan School of Management, Massachusetts Institute of Technology
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
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 computer program for solution of sequence dependent routing problems using a branch-and-bound algorithm	Richard Alan Jackson	1970	Naval Postgraduate School
A computerized algorithm for sequential search of the global maximum	Ray Lovell Springfield	1970	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 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.
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
An algorithm for the traveling salesman problem	John D. C. Little	1963	M.I.T.
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
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem	Ciaran McCreesh; Patrick Prosser	Principles and Practice of Constraint Programming: 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014, Proceedings	Barry O'Sullivan	2014	Springer International Publishing
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique	Etsuji Tomita; Tomokazu Seki	Discrete Mathematics and Theoretical Computer Science: 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings	Cristian S. Calude; Michael J. Dinneen; Vincent Vajnovszki	2003	Springer Berlin Heidelberg
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique	Etsuji Tomita and Tomokazu Seki	Discrete mathematics and theoretical computer science: 4th international conference, DMTCS 2003, Dijon, France, July 2003, proceedings /	Calude, Cristian,; Dinneen, M. J.; Vajnovszki, Vincent.	2003.	Springer,
A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem	Satoshi Shimizu; Kazuaki Yamaguchi; Sumio Masuda	Computational Science/Intelligence & Applied Informatics	Roger Lee	1st ed. 2019	Springer International Publishing
A New Branch and Bound Algorithm for the Clique Partitioning Problem	Jörg Rambau; Cornelius Schwarz	Operations Research Proceedings 2008: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR) University of Augsburg, September 3-5, 2008	Bernhard Fleischmann; Karl-Heinz Borgwardt; Robert Klein; Axel Tuma	2009	Springer Berlin Heidelberg
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique	Etsuji Tomita; Kohei Yoshida; Takuro Hatta; Atsuki Nagao; Hiro Ito; Mitsuo Wakatsuki	Frontiers in Algorithmics: 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings	Daming Zhu; Sergey Bereg	1st ed. 2016	Springer International Publishing
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique	Torsten Fahle	Algorithms - ESA 2002: 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings	Rolf Möhring; Rajeev Raman	2002	Springer Berlin Heidelberg
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique	Etsuji Tomita; Yoichi Sutani; Takanori Higashi; Shinya Takahashi; Mitsuo Wakatsuki	WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings	Md. Saidur Rahman; Satoshi Fujita	2010	Springer Berlin Heidelberg
A Genetic Algorithm for the Maximum Clique Problem	Rebecca Moussa; Romario Akiki; Haidar Harmanani	16th International Conference on Information Technology-New Generations (ITNG 2019)	Shahram Latifi	1st ed. 2019	Springer International Publishing
A Scatter Search Algorithm for the Maximum Clique Problem	Luís Cavique; César Rego; Isabel Themido	Essays and Surveys in Metaheuristics	Celso C. Ribeiro; Pierre Hansen	2002	Springer US
A New Genetic Algorithm for the Maximum Clique Problem	Gozde Kizilates Evin	Artificial Intelligence and Applied Mathematics in Engineering Problems: Proceedings of the International Conference on Artificial Intelligence and Applied Mathematics in Engineering (ICAIAME 2019)	D. Jude Hemanth; Utku Kose	1st ed. 2020	Springer International Publishing
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem	Mark Velednitsky; Dorit S. Hochbaum	Combinatorial Optimization and Applications: 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings	Donghyun Kim; R. N. Uma; Alexander Zelikovsky	1st ed. 2018	Springer International Publishing
MAXIMUM CLIQUE PROBLEM		Algorithms Design and Analysis	Harsh Bhasin	2015	Oxford
Branching Schemes for Branch-and-Bound	Emmanuel Néron	Resource-constrained Project Scheduling	Christian Artigues	2008	John Wiley & Sons
The Maximum Clique Problem	Immanuel M. Bomze; Marco Budinich; Panos M. Pardalos; Marcello Pelillo	Handbook of Combinatorial Optimization: Supplement Volume A	Ding-Zhu Du; Panos M. Pardalos	1999	Springer US
11. A Scatter Search Algorithm for the Maximum Clique Problem	L. Cavique, C. Rego and I. Themido	Essays and surveys in metaheuristics /	Ribeiro, Celso C.; Hansen, P.	[2002], ©2002.	Kluwer Academic Publishers,
A Parallel Branch-and-Bound Algorithm for the Classification Problem	Stefan Balev; Rumen Andonov; Arnaud Freville	High Performance Computing - HiPC' 99: 6th International Conference, Calcutta, India, December 17-20, 1999 Proceedings	Prith Banerjee; Viktor K. Prasanna; Bhabani P. Sinha	1999	Springer Berlin Heidelberg
A Branch and Bound Algorithm for the Cell Formation Problem	Irina Utkina; Mikhail Batsyn	Models, Algorithms and Technologies for Network Analysis: NET 2014, Nizhny Novgorod, Russia, May 2014	Valery A. Kalyagin; Petr A. Koldanov; Panos M. Pardalos	1st ed. 2016	Springer International Publishing
A Branch-and-Bound Algorithm for the Talent Scheduling Problem	Xiaocong Liang; Zizhen Zhang; Hu Qin; Songshan Guo; Andrew Lim	Modern Advances in Applied Intelligence: 27th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2014, Kaohsiung, Taiwan, June 3-6, 2014, Proceedings, Part I	Moonis Ali; Jeng-Shyang Pan; Shyi-Ming Chen; Mong-Fong Horng	2014	Springer International Publishing
An Exact Parallel Algorithm for the Maximum Clique Problem	Panos M. Pardalos; Jonas Rappe; Mauricio G. C. Resende	High Performance Algorithms and Software in Nonlinear Optimization	Renato de Leone; Almerico Murli; Panos M. Pardalos; Gerardo Toraldo	1998	Springer US
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem" - similar Books and Chapters