Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances of the Multiple-Depot Vehicle Scheduling ...

Given the flight schedule of an airline, the fleet assignment problem consists of determining the aircraft type to assign to each flight leg in order to max...

The variable neighborhood search metaheuristic is applied to the primal simple plant location problem and to a reduced dual obtained by exploiting the compl...

An infinite-horizon differential game between a manufacturer and a retailer is con- sidered. The players control their marketing efforts and the sales share...

In this paper, a solution approach based on the column generation technique is pre- sented for solving a time-indexed formulation of the total weighted tard...

We consider vehicle routing and crew scheduling problems that involve a lexico- graphic bi-level objective function (for instance, minimizing first the numb...

This paper examines the plant location problem under the objective of maximizing return-on-investment. However, in place of the standard assumption that all...

Column generation is one of the most successful approaches for solving large scale linear programming problems. However, degeneracy difficulties and long-ta...

Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues ...

Several upper bounds on the largest Laplacian eigenvalue of a graph <i>G</i>, in terms of degree and average degree of neighbors of its vertices, have been ...

This paper considers a shift scheduling problem that includes different forms of flexibility in terms of shift starting times, break lengths and break plac...

Une étude du transport de roses coupées, en collaboration avec la plantation Mira- flores évalue l’exportation de Bogotá (Colombie) vers Miami (USA), port d...

La localisation d'un site d'approvisionnement pour minimiser les coûts d'opérations est une problématique industrielle courante. Les variables classiques co...

Several variants and generalizations of the Or-opt heuristic for the <i>Symmetric Traveling Salesman Problem</i> are developed and compared on random and pla...

The continuous location-allocation problem requires finding sites for <i>m</i> new facilities in the plane in order to serve <i>n</i> users such that the to...

Variable Neighborhood Search (VNS) is a recent and effective metaheuristic for solving combinatorial and global optimization problems. It is capable of esca...

This paper introduces the first exact approach for constructing aircrew member personalized monthly work schedules when a preferential bidding system (PBS) ...

The global <i>k</i>-means heuristic is a recently proposed (Likas et al. 2003) incremental approach for minimum sum-of-squares clustering of a set <i>X</i> ...

In this paper we develop a Variable neighborhood search (VNS) heuristic for solving Mixed-Integer Programs (MIP’s). It uses CPLEX, the general-purpose MIP s...

An upper bound is given on the variance of degrees of graphs with <i>n</i> vertices, <i>m</i> edges and maximum degree &Delta;. Particular cases of chemical...