###### Home / files / Instances

## Instances

Several benchmarks instances were generated or collected during work with some optimization problems. These instances are listed below.

- Art Gallery Problem
- Balanced Connected k-Partition Problem (BCPk)
- Capacitated m Ring Star Problem
- Convex Recoloring Problem
- Graph Partition
- Milling Problem with Turn Costs
- Minimum Length Corridor Problem
- Overlapping Correlation Clustering Problem
- Optimal Vertex Separator Problem
- Scheduling Problem
- Instances for the Scheduling Problem Under Resource (Labour) Constraints

- Stochastic Capacitated Multi-depot Vehicle Routing - problem with pickup and delivery
- Two-dimensional Cutting Stock Problem
- Instances for the Two-dimensional Irregular Cutting Stock Problem
- Instances for the Two-dimensional Non-guillotine Cutting Stock Problem

- Three-dimensional Cutting Stock Problem
- Instances for the Three-dimensional Cutting Stock Problem
- Instances for the Three-dimensional Cutting Stock Problem with Variable Bin Sizes

- Two-dimensional Knapsack Problem
- Instances for the Two-dimensional Irregular 0/1 Knapsack Problem
- Instances for the Two-dimensional Irregular Unconstrained Knapsack Problem
- Instances for the Two-dimensional Unconstrained Non-guillotine Knapsack Problem

- Three-dimensional Knapsack Problem
- Instances for the Three-dimensional Unbounded Knapsack Problem

- Two-dimensional Strip Packing Problem
- Instances 1 for the Two-dimensional Strip Packing Problem with Multi-drop and Load Balancing Constraints
- Instances 2 for the Two-dimensional Strip Packing Problem with Multi-drop and Load Balancing Constraints
- Instances for the Two-dimensional Strip Packing Problem with Load Balancing and Load Bearing
- Instances for the Two-dimensional Strip Packing Problem with Order and Static Stability
- Instances for the Strip Packing Problem with Unloading Constraints

- Three-dimensional Strip Packing Problem
- Winner Determination Problem - Set Packing Problem
- Wireless Backhaul Network Design Problem