This book contains recent research on interval methods for solving nonlinear constraint
satisfaction, optimization and similar problems. It presents a comprehensive survey of …

Constraint propagation has been widely used in nonlinear single-objective optimization
inside interval Branch & Bound algorithms as an efficient way to discard infeasible and non …

As a proof of concept the properties of path-following methods are studied for multi-objective
optimization problems involving dynamic systems (also called multi-objective dynamic …

This paper surveys the research effort of several authors to solve various multicriteria
problems, using interval methods. These efforts fall naturally into two categories …

Interval based solvers are commonly used for solving single-objective nonlinear
optimization problems. Their reliability and increasing performance make them useful when …

This paper considers quadratic approximation as a narrowing tool in an interval branch-and-
prune method. We seek the roots of such an approximate equation–a quadratic equation …

Many problems, such as in engineering design or in location problems, require the
optimization of several conflicting nonlinear objectives subject to nonlinear constraints …

The paper surveys the investigations, performed by both the author and other researchers,
on interval branch-and-bound-type methods. It is devoted to considering several theoretical …

In this work, we propose a segment-based representation for the upper bound of the non-
dominated set in interval branch & bound solvers for biobjective non linear optimization. We …

This chapter presents a generic branch-and-bound-type algorithm, proposed by the author.
It is shown, how this sort of algorithms can be applied to solving general problems …