<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Combinatorial optimization / Mathematical logic / Mathematical optimization / Operations research / Algorithm / Sheaf / Branch and bound / Universal property / Equation solving / Boolean algebra
Date: 2012-08-02 21:04:29
Mathematics
Algebra
Combinatorial optimization
Mathematical logic
Mathematical optimization
Operations research
Algorithm
Sheaf
Branch and bound
Universal property
Equation solving
Boolean algebra

Science of Computer Programming, 14(2-3), 1990, ppAlgorithm Theories and Design Tactics Douglas R. Smith and Michael R. Lowry Kestrel Institute 3260 Hillview Avenue

Add to Reading List

Source URL: www.kestrel.edu

Download Document from Source Website

File Size: 141,08 KB

Share Document on Facebook

Similar Documents

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

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‡

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

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,

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

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