Network instance Job shop, edition 2

Datacite citation style:
Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2012): Network instance Job shop, edition 2. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:158448c5-3133-4d3e-b1e9-91e7312a4878
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
Dataset
STNs randomly generated in the SMT-LIB "diamonds" benchmark category. The benchmarks are DTP instances. STNs were generated from these by randomly selecting a literal from each clause. For each STN thus generated, the graph structure was maintained while modifying the weights of the constraint arcs such that at least one solution exists (i.e. the graph contains no negative cycles and the STN is consistent). This archive contains 400 graphs on 17–1321 vertices, 32–110220 edges, upper bound on treewidth 3–331. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
history
  • 2012-03-09 first online, published, posted
publisher
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
format
DIMACS graph format allowing infinite arc weights media types: application/x-gzip
organizations
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group;
University College Cork; Cork Constraint Computations Centre

DATA

files (1)