activity
20222025
most citedStochastic Capacitated Arc Routing Problem

1 citations · 5 across the 10 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

cs.NE2022★ 1 cited

Stochastic Capacitated Arc Routing Problem

Fleury Gérard, Lacomme Philippe, Christian Prins

This paper deals with the Stochastic Capacitated Arc Routing Problem (SCARP), obtained by randomizing quantities on the arcs in the CARP. Optimization problems for the SCARP are ch…

quant-ph2022

Description of the Grover algorithm based on geometric considerations

Gérard Fleury, Philippe Lacomme

This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure d…

quant-ph2022★ 1 cited

Mixer Hamiltonian with QAOA for Max k-coloring : numerical evaluations

Eric Bourreau, Gérard Fleury, Philippe Lacomme

This paper concerns quantum heuristics based on Mixer Hamiltonians that allow to restrict investigation on a specific subspace. Mixer Hamiltonian based approaches can be included i…

quant-ph2022

Adiabatic based Algorithm for SAT: a comprehensive algorithmic description

Eric Bourreau, Gérard Fleury, Philippe Lacomme

This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum appr…

cs.DM2022

A technical note for a Shor's algorithm by phase estimation

Gérard Fleury, Philippe Lacomme

The objective of this paper concerns at first the motivation and the method of Shor's algorithm including an excursion into quantum mechanics and quantum computing introducing an a…