metalibrary [Marcus Ritt]

metalibrary

Esta é uma versão antiga do documento!

Library of libraries of instances

Steiner trees
Bin packing
Quadratic Assignment Problem
Capacitated vehicle routing problem: VRP web and VRPlib
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
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

metalibrary.1311885764.txt.gz · Esta página foi modificada pela última vez em: 2011/07/28 17:42 por marcus