# 4OR

*quasi-k*series-parallel graphs (

*k*-QSP graphs). An

*aggregation*algorithm has already been introduced for the CPLCT problem on TTSP-graphs. We propose here a

*reconstruction*...

*optimal diversity management problem*formulated as a

*p-Median*problem. The problem is solved for very large scale real instances arising in the car industry and defined on a graph with several tens of thousands of nodes and with several millions of arcs. The particularity is that the graph can consist of several non connected components. This property is...

*CELAR*of the French Department of Defense, within the context of the CALMA project. Twenty seven competitors took part to this contest, and we present in this paper the contribution of our team that allowed us to be selected...

*O*(1) time for each operation the...

*P*

_{4}-

*free*graphs with a normal orientation.