Branch-and-Bound search is a basic algorithm for solving combinatorial optimization problems. Here we introduce a new lower-bounding methodology that can be incorporated into any branch-and-bound solver, and demonstraint its use on the MaxSAT constraint optimization problem. The approach is to adapt a minimum-height equivalent transformation framework that was first developed in the context of ...

Constraint-aggregation methods are used in engineering optimization problems to approximately impose a bound on a quantity of interest in a differentiable manner. In this paper, we present strategies to adaptively solve aggregation-constrained problems. These adaptive techniques achieve a tighter bound approximation while also reducing the computational cost of optimization. We focus on two agg...

The context of this research is multiobjective optimization where conflicting objectives are present. In work, these only available as the outputs a blackbox for which no derivative information available. This work proposes new extension mesh adaptive direct search (MADS) algorithm to derivative-free with bound constraints. method does not aggregate and keeps list non dominated points converges...

This survey covers the state of the art of techniques for solving general purpose constrained global optimization problems and continuous constraint satisfaction problems, with emphasis on complete techniques that provably find all solutions (if there are finitely many). The core of the material is presented in sufficient detail that the survey may serve as a text for teaching constrained globa...

trajectories generally used to describe the space and time required to perform a desired motion task for a mobile robot or manipulator system. in this paper, we considered a cubic polynomial trajectory for the problem of moving a mobile robot from its initial position to a goal position in over a continuous set of time. along the path, the robot requires to observe a certain acceleration profil...