Artificial Intelligence Artificial Intelligence

First Page		Document Content
Date: 2009-03-06 00:35:16 NP-complete problems Complexity classes Operations research Combinatorial optimization Travelling salesman problem Optimization problem NP Branch and bound Mathematical optimization Theoretical computer science Computational complexity theory Applied mathematics		Artificial Intelligence Artificial Intelligence Add to Reading List Source URL: www.cse.unsw.edu.au Download Document from Source Website File Size: 698,25 KB Share Document on Facebook

	Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell? Abstract. We consider optimization problems of th DocID: 1xV15 - View Document
	Source-side Preordering for Translation using Logistic Regression and Depth-first Branch-and-Bound Search∗ Laura Jehl? ? Adri`a de Gispert‡ DocID: 1uXFc - View Document
	MAX CUT SDP based Branch and Bound DocID: 1ucmo - View Document
	On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square✩ Alberto Costaa , Pierre Hansena,b , Leo Libertia,∗ b GERAD, DocID: 1ubEn - View Document
	Parallel Branch and Bound: Applying an Asynchronous Multi-Pool Approach to Cyclic Best First Search Joshua Gluck, Nartezya Dykes Swarthmore College, Spelman College, and The University of Illinois at Urbana-Champaign DocID: 1tNGx - View Document