Skip to main content
Operations Research Group Bologna
Main menu
Home
About
People
Staff
Fellows
Research
Library of Codes and Instances
Technical Reports
Projects
Financed Projects
Framework Agreements
Working Groups
Conferences & Seminars
Conferences
Seminars
LOOM
You are here
Research
Library of Codes and Instances Page
ASP Instances
Bin Packing Problem with Conflicts
BPPLIB – A Bin Packing Problem Library
Constraint Programming page
Feasibility Pump
Interval MinMax regret knapsack problem (MRKP)
k-Cardinality Assignment Problem
Knapsack Problem with Conflict Graph (KPCG)
Knapsack Problem with Setup
Library of Instances on the P||Cmax Problem
MIP Instances
Multiple Depot Vehicle Scheduling Problem
Multiple Non-Linear Knapsack Problem
Non Linear Knapsack Problem
Orthogonal Stock Cutting Problems
Packing into the Smallest Square
Pooling Problem with Binary Variables
Product Knapsack problem
Robust Knapsack Problem (RKP)
Short term Hydro Unit Commitment and Scheduling
Solving Standard Quadratic Programming by Cutting Planes
Staircase Capacitated Covering Problem (SCCP)
Temporal Knapsack Problem (TKP)
Test-Assignment – A Quadratic Coloring Problem
Three-Dimensional Capacitated Vehicle Routing Problem (3L-CVRP)
TSP Software
Two- and Three-Dimensional Bin Packing
Two-Constraint Bin Packing Problem
Two-Dimensional Bin Packing Problem
Two-Dimensional Capacitated Vehicle Routing Problem (2L-CVRP)
Two-Dimensional Strip Packing Problem
VRPLIB: A Vehicle Routing Problem LIBrary
Water Network Design