In this paper, we study efficient temporal planning based on a continuous and differentiable nonlinear programming transformation of the planning problem. Based on the observation that many large planning problems have constraint locality, we have previously proposed the constraint partitioning approach that utilizes the constraint structure by partitioning the constraints of a planning problem...

Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...

In this paper we show that the problem of minimizing a nonlinear objective function subject to a system of fuzzy relational equations with max-min composition can be reduced to a 0-1 mixed integer programming problem. The reduction method can be extended to the case of fuzzy relational equations with max-T composition as well as those with more general composition.

Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we inves...

In the context of a variation of the standard UFL (Uncapacitated Facility Location) problem, but with an objective function that is a separable convex quadratic function of the transportation costs, we present some techniques for improving relaxations of MINLP formulations. We use a disaggregation principal and a strategy of developing model-specific valid inequalities (some nonlinear), which e...

A penalty framework for globally solving mixed-integer nonlinear programming problems is presented. Both integrality constraints and nonlinear constraints are handled separately by hyperbolic tangent penalty functions. The preliminary numerical experiments show that the proposed penalty approach is effective and the hyperbolic tangent penalties compete with other popular penalties.

In this work, we present a new hybrid algorithm for convex Mixed Integer Nonlinear Programming combining branch-and-bound and outer approximation algorithms in an e ective and e cient way.

We discuss a problem arising in the strategic management of IT enterprises: that of replacing some existing services with new services without impairing operations. We formalize the problem by means of a Mathematical Programming formulation of the Mixed-Integer Nonlinear Programming class and show it can be solved to a satisfactory optimality approximation guarantee by means of existing off-the...