Local search methods start from a feasible solution and improve it by successive minor modifications until a solution that cannot be further improved is enco...

This paper focuses on the use of different memory strategies to improve multistart methods. A network design problem in which the costs are given by discrete...

We address a multi-objective version of the car sequencing problem, which consists in sequencing a given set of cars to be produced in a single day, minimizi...

Cellular manufacturing is a promising approach for grouping efficiency in manufacturing systems. Although this problem has been extensively studied in the ...

We recently proposed to model location and sizing of offshore platforms for oil exploration and production as a multicapacitated plant location problem. We...

We give a new formulation to the multiple-depot vehicle scheduling problem as a set partitioning problem with side constraints, whose continuous relaxation ...

We present algorithms for computing some distance functions between two (possibly intersecting) polygons, both in the convex and nonconvex cases. The inter...

We present in this paper a linear time algorithm for the computation of some distance functions between convex polygons in R² in the general case...

We propose in this paper new approximate algorithms for the Minimum Rectilinear Steiner Tree problem, based on a two-point-connection strategy. We also pres...

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process ...

The computation of penalties associated with the continuous relaxation of integer programming problems can be useful to derive conditional and relational te...

The problem of optimal location and sizing of off-shore platforms for oil exploration can be formulated as follows: given a set of oil wells to be drilled a...

We study in this paper the application of simulated annealing and tabu search in the solution of the clique partitioning problem. We illustrate the effectiv...

Unconstrained hyperbolic 0-1 programming can be solved in linear time when the numerator and the denominator are linear and the latter is always positive. I...

An "intelligent front-end" or "logic assistant" is an interactive program devised to assist the users of an information retrieval system in the formulation ...