We consider the problem of finding a fundamental cycle basis with minimum total cost in an undirected graph. This problem is NP-hard and has several interesting applications. Since fundamental cycle bases correspond to spanning trees, we propose a local search algorithm, a tabu search and...

We consider the k-Hyperplane Clustering problem where, given a set of m points in Rn, we have to partition the set into k subsets (clusters) and determine a hyperplane for each of them, so as to minimize the sum of the squares of the Euclidean distances between the points and the hyperplane of...

We consider the problem of finding a fundamental cycle basis with minimum total cost in an undirected graph. This problem is NP-hard and has several interesting applications. Since fundamental cycle bases correspond to spanning trees, we propose a local search algorithm, a tabu search and...

A detailed optimization model is presented for planning the short-term operation of combined cooling, heat and power (CCHP) energy systems. The purpose is, given the design of a cogeneration system, to determine an operating schedule that minimizes the total operating and maintenance costs minus...

In the bottleneck hyperplane clustering problem, given n points in <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$\mathbb{R}^{d}$</EquationSource> </InlineEquation> and an integer k with 1≤k≤n, we wish to determine k hyperplanes and assign each point to a hyperplane so as to minimize the maximum Euclidean distance between each point and its assigned hyperplane. This...</equationsource></inlineequation>

We propose mathematical programming models for solving problems arising from planning and running an energy production process based on burning biomasses. The models take into account different aspects of the problem: determination of the biomasses to produce and/or buy, transportation decisions...