Maximum Cut Problem

The Maximum Cut Problem is a combinatorial optimization problem included in the QOPTLib benchmark, which consists of instances used to evaluate the performance of quantum computing approaches in solving optimization challenges.

Papers using Maximum Cut Problem (2)

Qoptlib: A Quantum Computing Oriented Benchmark For Combinatorial Optimization Problems2024 · 11 citesQOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems2024