# 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.
Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
Cite this
DataSetCite
Osaba Icedo, E. (Creator), Villar, E. (Contributor) (22 Mar 2023). QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems. Mendeley Data. 10.17632/h32z9kcz3s.1