A counter-example to the characterization of the discontinuous value function of control problems with reflectionUn contre-exemple à la caractérisation de la fonction-valeur discontinue d'un problème de contrôle réfléchi

We consider a finite horizon deterministic optimal control problem with reflection. The final cost is assumed to be merely a locally bounded function which leads to a discontinuous value function. We address the question of the characterization of the value function as the unique solution of an Hamilton–Jacobi equation with Neumann boundary conditions. We follow the discontinuous approach developed by Barles and Perthame for problems set in the whole space. We prove that the minimal and maximal discontinuous viscosity solutions of the associated Hamilton–Jacobi can be written in terms of value functions of control problems with reflection. Nethertheless, we construct a counter-example showing that the value function is not the unique solution of the equation. To cite this article: O. Ley, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 469–473.     

Structures de Hodge mixtes et faisceaux réflexifs semistablesMixed Hodge structures and semistable reflexive sheaves

Let X be a smooth projective variety over an algebraically closed field of characteristic 0. We prove that the category of μ-semistable reflexive sheaves of slope μ equivariant for the action of some group on X is Abelian. The same claim for $\text{X=}\text{P}{}^2{}_{\mathrm{<mtext>C</mtext>}}$ and a stronger semistability condition gives us a geometric proof of the fact that the category of mixed Hodge structures is Abelian. To cite this article: O. Penacchio, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 475–480.     

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics.     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.     

Expedient synthesis of villosin and its isomer (E)-labda-8(17),12,14-trien-15(16)-olide

The synthesis of the title compounds has been achieved in concise, highly regiocontrolled fashion from commercially available (+)-sclareolide. In addition, we offer evidence that the structure of a newly reported natural product from Zingiber ottensii is incorrect.     

Total synthesis of malayamycin A and analogues

The total synthesis of the bicyclic C-nucleoside malayamycin A is described starting with d-ribonolactone. A new method was developed to obtain preparatively important quantities of β-pseudouridine, which was used as an intermediate. The synthesis of a carba N-nucleoside analogue of malayamycin A is also described.