Bonn Mathematics

Research data from all areas of Bonn mathematics.

Featured Dataverses

In order to use this feature you must have at least one published or linked dataverse.

Publish Dataverse

Are you sure you want to publish your dataverse? Once you do so it must remain published.

Publish Dataverse

This dataverse cannot be published because the dataverse it is in has not been published.

Delete Dataverse

Are you sure you want to delete your dataverse? You cannot undelete this dataverse.

21 to 30 of 431 Results

Matlab_Code.zip Dec 12, 2024 - Simulation for quasi-geodesic in ASEP and speed changed ASEP ZIP Archive - 14.0 KB - MD5: f51e79ef984e1ec3617f9018c0cd9b96 This file contains all the MATLAB-based codes: distribution of maximizer of the Airy2 process minus parabola, ASEP, ASEPsc, quasi-geodesic, and so on.
ReadMe.pdf Dec 12, 2024 - Simulation for quasi-geodesic in ASEP and speed changed ASEP Adobe PDF - 331.5 KB - MD5: ecd23401e9f5d8f2c1fc271bfef64831 This document contains a list of codes and data, as well as the simulation methods we used.
Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic Nov 5, 2024 Brand, Timo; Held, Stephan, 2024, "Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic", https://doi.org/10.60507/FK2/ZE9C3L, bonndata, V1 This dataset contains source code and consoles for computing chromatic numbers with exact decision diagrams, solving integer programs with exact arithmetic. The chromatic number of the DIMACS instance r1000.1c could be determined for the first time. There are 3 files: - ddruns_main.zip contains scripts to reproduce the results - ddruns.tar contains...
README.md Nov 5, 2024 - Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic Markdown Text - 848 B - MD5: d97dfaf04f65fded991377d4fb4ba0b9 Data set README
ddcolors-flow_extraction.zip Nov 5, 2024 - Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic ZIP Archive - 41.4 KB - MD5: 10fa4645ff4ff9d5c0504204d65a1208 C++ code for generating exact decision diagrams for graph coloring.
ddruns-main.zip Nov 5, 2024 - Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic ZIP Archive - 25.5 MB - MD5: 293beb08800f0b928fc73551c3eb2f87 Bash scripts to download and compile SCIP and ddcolors and for computing & solving graph coloring ILPs based on exact decision diagrams.
ddruns.tar Nov 5, 2024 - Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic TAR Archive - 6.6 GB - MD5: 1f11b823ef41cf5ad062162568025430 Tar file containing all logfiles & certificates of exact decision diagram compilations (ddlogs).
BonnTour: benchmarks & solutions for vehicle routing with time-dependent travel times Sep 20, 2024 Blauth, Jannis; Held, Stephan; Müller, Dirk; Schlomberg, Niklas; Traub, Vera; Tröbst, Thorben; Vygen, Jens, 2024, "BonnTour: benchmarks & solutions for vehicle routing with time-dependent travel times", https://doi.org/10.60507/FK2/X22BKR, bonndata, V1 This repository contains the new vehicle routing benchmark instances that we created as part of our work on vehicle routing with time-dependent travel times. To create this benchmark set, we used map data copyrighted by OpenStreetMap contributors and available from https://www.openstreetmap.org under the Open Database License (ODbL) v1.0, and speed...
vrptdt-benchmark-main.tar.bz2 Sep 20, 2024 - BonnTour: benchmarks & solutions for vehicle routing with time-dependent travel times Bzip Archive - 5.1 GB - MD5: 8577cdadb01da914d879b89b536e3496 Archive file with the BonnToure benchmark data from https://gitlab.com/muelleratorunibonnde/vrptdt-benchmark git revision: 1306f4b22a5ecf3307edcce3962c47c7f122adea
Large Benchmarks for the Minimum-Cost Flow Problem Sep 20, 2024 Held, Stephan, 2024, "Large Benchmarks for the Minimum-Cost Flow Problem", https://doi.org/10.60507/FK2/5IKK7K, bonndata, V1 Minimum cost flow instance generated at the Research Institute for Discrete Mathematics, University of Bonn. Contact: Stephan Held (held@dm.uni-bonn.de) These instances arise in VLSI placement legalization (LEGALIZATION subdir) or as linear relaxation of the discrete time-cost tradeoff problem used for voltage threshold assignment (TCT subdir). The...

Matlab_Code.zip

Dec 12, 2024 - Simulation for quasi-geodesic in ASEP and speed changed ASEP

ZIP Archive - 14.0 KB -

This file contains all the MATLAB-based codes: distribution of maximizer of the Airy2 process minus parabola, ASEP, ASEPsc, quasi-geodesic, and so on.

ReadMe.pdf

Dec 12, 2024 - Simulation for quasi-geodesic in ASEP and speed changed ASEP

Adobe PDF - 331.5 KB -

This document contains a list of codes and data, as well as the simulation methods we used.

Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic

Nov 5, 2024

Brand, Timo; Held, Stephan, 2024, "Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic", https://doi.org/10.60507/FK2/ZE9C3L, bonndata, V1

This dataset contains source code and consoles for computing chromatic numbers with exact decision diagrams, solving integer programs with exact arithmetic. The chromatic number of the DIMACS instance r1000.1c could be determined for the first time. There are 3 files: - ddruns_main.zip contains scripts to reproduce the results - ddruns.tar contains...

README.md

Nov 5, 2024 - Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic

Markdown Text - 848 B -

Data set README

ddcolors-flow_extraction.zip

Nov 5, 2024 - Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic

ZIP Archive - 41.4 KB -

C++ code for generating exact decision diagrams for graph coloring.

ddruns-main.zip

Nov 5, 2024 - Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic

ZIP Archive - 25.5 MB -

Bash scripts to download and compile SCIP and ddcolors and for computing & solving graph coloring ILPs based on exact decision diagrams.

ddruns.tar

Nov 5, 2024 - Chromatic Numbers from Exact Decision Diagrams in Exact Arithmetic

TAR Archive - 6.6 GB -

Tar file containing all logfiles & certificates of exact decision diagram compilations (ddlogs).

BonnTour: benchmarks & solutions for vehicle routing with time-dependent travel times

Sep 20, 2024

Blauth, Jannis; Held, Stephan; Müller, Dirk; Schlomberg, Niklas; Traub, Vera; Tröbst, Thorben; Vygen, Jens, 2024, "BonnTour: benchmarks & solutions for vehicle routing with time-dependent travel times", https://doi.org/10.60507/FK2/X22BKR, bonndata, V1

This repository contains the new vehicle routing benchmark instances that we created as part of our work on vehicle routing with time-dependent travel times. To create this benchmark set, we used map data copyrighted by OpenStreetMap contributors and available from https://www.openstreetmap.org under the Open Database License (ODbL) v1.0, and speed...

vrptdt-benchmark-main.tar.bz2

Sep 20, 2024 - BonnTour: benchmarks & solutions for vehicle routing with time-dependent travel times

Bzip Archive - 5.1 GB -

Archive file with the BonnToure benchmark data from https://gitlab.com/muelleratorunibonnde/vrptdt-benchmark git revision: 1306f4b22a5ecf3307edcce3962c47c7f122adea

Large Benchmarks for the Minimum-Cost Flow Problem

Sep 20, 2024

Held, Stephan, 2024, "Large Benchmarks for the Minimum-Cost Flow Problem", https://doi.org/10.60507/FK2/5IKK7K, bonndata, V1

Minimum cost flow instance generated at the Research Institute for Discrete Mathematics, University of Bonn. Contact: Stephan Held (held@dm.uni-bonn.de) These instances arise in VLSI placement legalization (LEGALIZATION subdir) or as linear relaxation of the discrete time-cost tradeoff problem used for voltage threshold assignment (TCT subdir). The...

Add Data

Share Dataverse

Link Dataverse

Reset Modifications