6 citations · 6 across the 4 of their papers we have counts for
4 papers
A quantum feasibility preserving modeling for the min cut problem
Ali Abbassi, Yann Dujardin, Eric Gourdin +2
We study the minimum cut problem in weighted undirected graphs using variational quantum algorithms in which only feasible cut configurations are explored. Although minimum cut adm…
Quantum Approaches to the Minimum Edge Multiway Cut Problem
Ali Abbassi, Yann Dujardin, Eric Gourdin +2
We investigate the minimum edge multiway cut problem, a fundamental task in evaluating the resilience of telecommunication networks. This study benchmarks the problem across three…
Assessing Quantum Annealing to Solve the Minimum Vertex Multicut
Ali Abbassi, Yann Dujardin, Eric Gourdin +2
Cybersecurity in telecommunication networks often leads to hard combinatorial optimization problems that are challenging to solve with classical methods. This work investigates the…
A GRASPxELS with Depth First Search Split Procedure for the HVRP
Christophe Duhame, Philippe Lacomme, Caroline Prodhon
Split procedures have been proved to be efficient within global framework optimization for routing problems by splitting giant tour into trips. This is done by generating optimal s…