20 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 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

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...

The Flexible Job-Shop Scheduling Problem (FJSSP) is a combinatorial optimization problem where the goal is to find the optimal schedule for a set of jobs on a set of machines.

The Vehicle Routing Problem (VRP) is a classic problem in combinatorial optimization. The problem is to find the shortest route that visits each node in a graph exactly once and...

The CVRP dataset is a set of instances of the Capacitated Vehicle Routing Problem, a classic problem in Operations Research. The dataset is used to test the performance of...

The dataset used in the paper is a collection of combinatorial optimization problems, including concatenated deceptive traps, NK landscapes, and the HIFF function.

The dataset used in the paper is a collection of combinatorial optimization problems, including concatenated deceptive traps, NK landscapes, and the HIFF function.

The dataset used in this paper is a collection of four NP-hard benchmark problems: Set Covering (SC), Maximal Independent Set (MIS), Combinatorial Auction (CA), and Maximum Cut...