QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems

# QOPTLib QOPTLib is a quantum computing oriented benchmark for combinatorial optimization. QOPTLib is comprised of 40 different instances, equally distributed among for well-known problems: Traveling Salesman Problem, Vehicle Routing Problem, one-dimensional Bin Packing Problem and the Maximum Cut Problem.# QOPTLib QOPTLib是一款面向量子计算的组合优化（Combinatorial Optimization）基准测试集。该基准测试集包含40个不同的测试实例，均匀分布于四类经典问题：旅行商问题（Traveling Salesman Problem）、车辆路径问题（Vehicle Routing Problem）、一维装箱问题（one-dimensional Bin Packing Problem）以及最大割问题（Maximum Cut Problem）。