A Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems: QOPTLib

QOPTLib is a quantum computing oriented benchmark for combinatorial optimization problems, comprising 40 instances across four well-known problems: Traveling Salesman Problem, Vehicle Routing Problem, one-dimensional Bin Packing Problem, and Maximum Cut Problem.