Dynamic programming is applied to the economic dispatch problem with spin- ning reserve constraint. A first algorithm, based on a direct application of Bell...

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> ...

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...

Chemical graphs, as other ones, are <i>regular</i> if all their vertices have the same degree. Otherwise, they are <i>irregular</i> and it is of interest to...

Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclu...

Computer-assisted and automated conjecture-making in graph theory is reviewed, focusing on the three operational systems GRAPH, Graffiti and AutoGraphiX (AGX...

In the present paper we review the method of augmenting graphs, which is a general approach to solve the maximum independent set problem. Our objective is th...

The problem retained for the ROADEF'2001 international challenge was a frequency assignment problem with polarization constraints (FAPP). This NP-hard probl...

<i>Tabucol</i>&nbsp; is a tabu search algorithm that tries to determine whether the vertices of a given graph can be colored with a &#64257;xed number <i>k</...

Two ways for bounding <i>n</i>-variables functions over a box, based on interval evalu- ations of first order derivatives, are compared. The optimal Baumann...

In this paper, we study the Pitman asymptotic efficiencies of the sign and the Wilcoxon signed-rank tests for cluster correlated data. A general expression ...

This paper presents algorithms to find vertex-critical and edge-critical subgraphs in a given graph <i>G</i>, and demonstrates how these critical subgraphs ...

Let <i>G</i>=(<i>V,E</i>) be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-colouring problem is to assign a colour (a number chosen ...

We consider the bilevel uncapacitated facility location problem with user preferences. It is known that this model may be reformulated as a one-level locati...

Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate ...

When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than se...

The berth allocation problem is to allocate space along the quayside to incoming ship at a container terminal in order to minimize some objective function....

In this paper, we adapt the Wilcoxon signed-rank test to the case of cluster correlated data. A simple modification of the estimator of the asymptotic vari...

The berth allocation problem is to allocate berths (i.e., sections of the quayside) to ships arriving in a container port in order to minimize the sum of the...

In this paper, we perform an empirical comparison of the classification error of several ensemble methods based on classification trees. This comparison is b...