metalibrary [Marcus Ritt]

metalibrary

Esta é uma versão antiga do documento!

Library of libraries of instances

Steiner trees
Bin packing
Quadratic Assignment Problem
Vehicle routing problems: VRP web, VRPlib, and HEC
Asymmetric traveling salesman
Graph partitioning
Quantified boolean formulas
Boolean satisfiability
Constraint programming
Large graphs for shortest paths
Mixed integer programming
Train time-tabling
Survivable network design
Set cover, também aqui
Maximum independent set and minimum vertex cover
Scheduling problems
Graph coloring
Binary quadratic and max cut
Max cut
Packlib2: 2D and 3D packing problems
Edge-Weighted K-Cardinality Tree Problem
Difficult instances for clique, independent set, vertex cover and coloring
Taillard instances for job shop scheduling.
Project scheduling library.
Orienteering.
Discrete location problems benchmarks library
Employee Scheduling Benchmark Data Sets
Weighted Tardiness Sequencing with Sequence-Dependent Setups
Beasley's OR Library
Shop scheduling
Bi-criteria benchmarks for flow-shop scheduling problems with uncertain processing times
Problem set from Railway applications
Uncapacitated facility location
Linear arrangement (Petit)
Linear ordering
Traveling Umpire Problem
Pickup and delivery problems

metalibrary.1472842068.txt.gz · Esta página foi modificada pela última vez em: 2016/09/02 15:47 por marcus