BC-PROD is a prototype modelling and optimization system designed and able to tackle a wide variety of the discrete-time lot-sizing problems arising both in practice and in the literature. To use BC-PROD, the user needs to formulate his/her problem as a mixed integer program using XPRESS-MP's...

We investigate the computational issues that need to be addressed when incorporating general cutting planes for mixed 0-1 programs into a branch-and-cut framework. The cuts we use are of the lift-and-project variety. Some of the issues addressed have a theoretical answer, but others are of an...

This note proposes an alternative procedure for identifying violated subtour elimination constraints (SECs) in branch-and-cut algorithms for elementary shortest path problems. The procedure is also applicable to other routing problems, such as variants of travelling salesman or shortest...

In 1997 two papers applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) to the p-median problem were published in consecutive volumes of the European Journal of Operational Research. Here we apply the method of HC some of the data sets which were used for computational...