This paper synthesizes the Balasian implicit enumeration approach to integer linear programming with the approach typified by LAND AND DOIG and by ROY, BEBTIER, AND NGHIEM. The synthesis results from the use of an imbedded linear program to compute surrogate constraints that are as 'strong' as possible in a sense slightly different from that originally used by GLOVBK. A simple implicit enumerat...

We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and Hébrard [CH97] and generalized by Cohen [Coh04], reduces the enumeration problem for a constraint language Γ to the decision problem for a slightly enlarged constraint language Γ, i.e., it yields an efficient enumeration...

12 Large singularities of analytic functions 113 12.1 The saddle point 13 Multivariate generating functions 128 14 Mellin and other integral transforms 134 15 Functional equations, recurrences, and combinations of methods 137 15.1 Implicit functions, graphical enumeration, and related

We introduce and study a new class of generalized nonlinear implicit quasivariational inclusions involving relaxed Lipschitzian mappings. We prove the existence of solution for the generalized nonlinear implicit quasivariational inclusions and construct some new stable perturbed iterative algorithms with errors. We also give an application to a class of generalized nonlinear implicit variationa...

This note presents an implicit function theorem for generalized equations, simultaneously generalizing Robinson’s implicit function theorem for strongly regular generalized equations and Clarke’s implicit function theorem for equations with Lipschitz-continuous mappings.

We discuss adaptive enumeration and rendering methods for implicit surfaces , using octrees computed with aane arithmetic, a new tool for range analysis. AAne arithmetic is similar to standard interval arithmetic, but takes into account correlations between operands and sub-formulas, generally providing much tighter bounds for the computed quantities. The resulting octrees are accordingly much ...