27 datasets found

The CVRPLib is a library of instances for the Capacitated Vehicle Routing Problem (CVRP). It consolidates instances from various sources and provides a set of instances with...

The Capacitated Vehicle Routing Problem (CVRP) dataset, a combinatorial optimization problem in which a set of locations must be covered by a single vehicle with limited capacity.

The dataset used in the paper for OnCallRostering, which is a type of combinatorial optimization problem.

The dataset used in the paper is a set of undirected graphs, specifically Erdoøs-Renyi random graphs and regular random graphs.

The dataset used in this paper is a set of two-player zero-sum games with bilinear loss functions.

The dataset used in this paper is a collection of combinatorial optimization problems, including MIS and MaxCut problems on random regular graphs (RRGs) with varying degrees.

Combinatorial 3D shape generation framework using Bayesian optimization

The dataset used in the dual task of ML4CO competition, which is a mixed-integer linear program (MILP) problem.

The dataset used in the ML4CO competition, which is a mixed-integer linear program (MILP) problem.

A dataset for learning combinatorial optimization algorithms over graphs.

The dataset is used to predict the final objective function value of a difficult combinatorial optimization problem from the input.

The dataset used in the paper is the Minimum Spanning Tree problem, a combinatorial optimization problem where the goal is to find a minimum spanning tree of a graph.

GenCO: Generating Diverse Designs with Combinatorial Constraints

The dataset used in this paper is a Restricted Boltzmann Machine (RBM) for combinatorial optimization and integer factorization.

The dataset is used to evaluate the performance of the proposed method.

The dataset is used to evaluate the performance of the proposed method.

The dataset is used to evaluate the performance of the proposed method.

The dataset is used to evaluate the performance of the proposed method.

The dataset is used to evaluate the performance of the proposed method.

The Traveling Salesman Problem (TSP) is a classic problem in combinatorial optimization and operations research that involves finding the shortest possible tour that visits each...