Constraint-based approaches recently brought new insight into our understanding of
metabolism. By making very simple assumptions such as that the system is at steady-state …

Bensolve is an open source implementation of Benson's algorithm and its dual variant. Both
algorithms compute primal and dual solutions of vector linear programs (VLP), which include …

We present a new pivot-based algorithm which can be used with minor modification for the
enumeration of the facets of the convex hull of a set of points, or for the enumeration of the …

Introduction Page 1 Chapter 1 Introduction Constrained global optimization is concerned
with the characterization and computation of global minima or maxima of nonconvex …

The double description method is a simple and useful algorithm for enumerating all extreme
rays of a general polyhedral cone in ℝ d, despite the fact that we can hardly state any …

Publisher Summary This chapter presents the formalism and applications of cluster
expansions to the problem of ab initio calculations of thermodynamic properties of crystalline …

A d dimensional convex polyhedron is the intersection of a finite number m of non-redundant
halfspaces '1-l={kf], 172,... I-1~} of $? d. A bounded convex polyhedron is called a polytope …

Branch and bound techniques are the most commonly used for the efficient solution of
nonconvex global optimization problems. Branching usually refers to a successive …

Quadratic optimization comprises one of the most important areas of nonlinear
programming. Numerous problems in real world applications, including problems in …

Constrained optimization models are core tools in business, science, government, and the
military with applications including airline scheduling, control of petroleum refining …