In this paper we present a heuristic framework that is based on mathematical programming to solve network design problems. Our techniques combine local branching with locally exact refinements. In an iterative strategy an existing solution is refined by solving restricted mixed integer programs...

Feature selection is to choose a subset of features, out of a set of candidate features, such that the selected set best represents the whole in a particular aspect. We present a bi-objective optimization model for a feature selection problem in the context of data grouping. The aim is to select...

The minimum covering location problem with distance constraints (MCLPDC) deals with locating a set of undesirable facilities on a geographical map, where there is a given minimum distance between any pair of located facilities. The objective is to minimize the total population covered by the...

The aircraft landing problem (ALP) is the problem of allocating an airport's runways to arriving aircraft as well as scheduling the landing time of aircraft, with the objective of minimizing the total deviations from the target landing times. We propose simple heuristics to solve the ALP. The...

The ordered flow-shop scheduling problem deals with the case where processing times follow a specific structure. We extend the ordered flow-shop scheduling to the coupled tasks setting, i.e., the coupled task ordered flow-shop, in which an exact delay exists between the consecutive tasks of each...