Showing papers on "Bounding overwatch published in 1981"
TL;DR: In this article, the interval Newton method was used for bounding solutions to a set of n nonlinear equations, and an improved version was given, which is a superior type of Newton method to Krawczyk's method.
Abstract: We introduce some variations of the interval Newton method for bounding solutions to a set ofn nonlinear equations. It is pointed out that previous implementations of Krawczyk's method are very inefficient and an improved version is given. A superior type of Newton method is introduced.
154 citations
TL;DR: A bounding technique for use in implicit enumeration algorithms for solving the integer linear programming problem with binary variables that enables fixing the values of some of the variables from the outset, and then provides “joint” bounds onSome of the other variables so that many combinations of their binary values can be eliminated from further consideration.
Abstract: We present a bounding technique for use in implicit enumeration algorithms for solving the integer linear programming problem with binary variables. This technique enables fixing the values of some of the variables from the outset, and then provides “joint” bounds on some of the other variables so that many combinations of their binary values can be eliminated from further consideration. After illustrating the approach, we give some indications that the bounds may be used efficiently and then present some preliminary computational experience. Finally, a class of problems particularly well-suited to this bounding procedure is specified.