cometadata/datacite-titles-descriptions-related-identifiers huggingface dataset:
DOI: 10.60507/fk2/1dguve
title: Minimum Mean Cycle Instances

description: This data set contains some large real-world instances of the minimum mean cycle problem.
They are reported as the bonn01 to bonn09 instances in the paper:
&lt;br&gt;
&lt;br&gt;
Georgiadis, L., Goldberg, A. V., Tarjan, R. E., & Werneck, R. F.
"An experimental study of minimum mean cycle algorithms",
in 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 1–13,
SIAM.
&lt;br&gt;
&lt;br&gt;
The instances arise in clock skew scheduling in chip design, e.g. see
&lt;br&gt;
&lt;br&gt;
Held, S., Korte, B., Rautenbach, D. and Vygen, J.
"Combinatorial optimization in VLSI design. Combinatorial Optimization",
in Combinatorial Optimization, NATO Science for Peace and Security Series - D: Information and Communication Security, pp. 33–96, 2011.
&lt;br&gt;
&lt;br&gt;
The clock skew scheduling problem in chip design is, given a directed graph G with edge delays d:E(G)-&gt; R,
find a minimum cycle time T and arrival times (a schedule) a: V(G) -&gt; R such that
&lt;br&gt;
&lt;br&gt;
 a(v) + d(v,w) &lt;= a(w) + T for all (v,w) in E(G).
&lt;br&gt;
&lt;br&gt;
G is called a latch graph. The nodes represent latches and registers, and the edges represent the longest signal paths between registers.
&lt;br&gt;
The problem of minimizing T is equivalent to maximizing the worst slack min{s(v,w) := a(w) + T - a(v) - d(v,w) | (v,w) in E(G)} for a fixed cycle time T.

&lt;br&gt;

The instances provided in the tar file below consist of directed graphs with edge costs c(v,w) = T - d(v,w),
i.e. edge slacks w.r.t. a zero-skew schedule where a = 0.
The maximum achievable worst slack by varying the schedule 'a' equals the value of a minimum mean cycle in (G,c).
Instance sizes range from 70346 nodes and 898220 edges to 1065274 nodes and 104340248 edges.
Other instances are very dense, e.g. 5361 nodes and 4169878 edges.
&lt;br&gt;
Note that the instances may not be strongly connected or even connected.
Format: Ignore empty lines and lines starting with '#', then:
1st line: number_of_nodes number_of_edges
next lines: from_node to_node edge_cost (i.e., zero skew slack)
DOI: 10.60507/fk2/6n5lf1
title: single crystal X-ray structure data files from the dissertation "Synthesis and characterization of new thiophosphates with chromium and vanadium"

description: Einkristallröntgenstrukturanalysedaten aus der Disstertation "Synthese und Charakterisierung neuer Thiophosphate mit Chrom und Vanadium" im cif-Format.
Es handelt sich um Thiophosphatverbindungen, die als kristalline Produkte aus Festkörpersynthesen entstanden sind.
Single crystal X-ray structure analysis data from the dissertation "Synthesis and characterization of new thiophosphates with chromium and vanadium" in cif format.
These are thiophosphate compounds that were formed as crystalline products from solid-state syntheses.
DOI: 10.60507/fk2/6n5lf1/thp26y
title: A2_TlCrP2S7_253K_P.cif
DOI: 10.60507/fk2/6n5lf1/2sjfgh
title: A2_TlCrP2S7_113K_P.cif
DOI: 10.60507/fk2/6n5lf1/lencc9
title: A5_Cs4[Cr2Cl4(PS4)2]_213K.cif
DOI: 10.60507/fk2/6n5lf1/b70opo
title: A5_Cs4[Cr2Cl4(PS4)2]_173K.cif
DOI: 10.60507/fk2/6n5lf1/aj4hrs
title: A2_TlCrP2S7_203K_P.cif
DOI: 10.60507/fk2/6n5lf1/kduzne
title: A2_TlCrP2S7_283K_C.cif
DOI: 10.60507/fk2/6n5lf1/hgmfly
title: A2_TlCrP2S7_293K_C.cif
DOI: 10.60507/fk2/6n5lf1/hbkxl7
title: A2_TlCrP2S7_183K_P.cif
DOI: 10.60507/fk2/6n5lf1/inttwi
title: A12_Rb3CoCl5_293K.cif
DOI: 10.60507/fk2/6n5lf1/udcla7
title: A2_TlCrP2S7_303K_C.cif
DOI: 10.60507/fk2/6n5lf1/hzaygi
title: A3_TlVP2S7_168K_C.cif
DOI: 10.60507/fk2/6n5lf1/j633md
title: A2_TlCrP2S7_123K.cif
DOI: 10.60507/fk2/6n5lf1/cpravk
title: A8_Cs4[Cr2Br4(PS4)2]_293K.cif
DOI: 10.60507/fk2/6n5lf1/550zjo
title: A2_TlCrP2S7_233K_C.cif
DOI: 10.60507/fk2/6n5lf1/brm7et
title: A2_TlCrP2S7_223K_P.cif
DOI: 10.60507/fk2/6n5lf1/oarvw2
title: A2_TlCrP2S7_253K_C.cif
DOI: 10.60507/fk2/6n5lf1/hzifxz
title: A3_TlVP2S7_103K_P.cif
DOI: 10.60507/fk2/6n5lf1/nyxdpc
title: A3_TlVP2S7_163K_C.cif
DOI: 10.60507/fk2/6n5lf1/uoktym
title: A5_Cs4[Cr2Cl4(PS4)2]_97K.cif
DOI: 10.60507/fk2/6n5lf1/dintg5
title: A2_TlCrP2S7_163K_P.cif
DOI: 10.60507/fk2/6n5lf1/0u4bv3
title: A2_TlCrP2S7_193K_P.cif
DOI: 10.60507/fk2/6n5lf1/wnic3s
title: A2_TlCrP2S7_213K_P.cif
DOI: 10.60507/fk2/6n5lf1/ajfi5p
title: A3_TlVP2S7_143K_C.cif
DOI: 10.60507/fk2/6n5lf1/yhpmn8
title: A2_TlCrP2S7_333K_C.cif
DOI: 10.60507/fk2/6n5lf1/ymszjq
title: A2_TlCrP2S7_243K_C.cif
DOI: 10.60507/fk2/6n5lf1/5yy9pq
title: A3_TlVP2S7_98K_P.cif
DOI: 10.60507/fk2/6n5lf1/9vo5mv
title: A3_TlVP2S7_108K_P.cif
DOI: 10.60507/fk2/6n5lf1/upuewg
title: A3_TlVP2S7_133K_P.cif
DOI: 10.60507/fk2/6n5lf1/z0tnfl
title: A2_TlCrP2S7_323K_C.cif
DOI: 10.60507/fk2/6n5lf1/zsi9ly
title: A2_TlCrP2S7_153K_P.cif
DOI: 10.60507/fk2/6n5lf1/hqh24t
title: A2_TlCrP2S7_223K_C.cif
DOI: 10.60507/fk2/6n5lf1/suicik
title: A9_Tl4[V3P4S17]_123K.cif
DOI: 10.60507/fk2/6n5lf1/mhwdx6
title: A2_TlCrP2S7_103K_P.cif
DOI: 10.60507/fk2/6n5lf1/q1ysm5
title: A3_TlVP2S7_123K_P.cif
DOI: 10.60507/fk2/6n5lf1/ksnigi
title: A2_TlCrP2S7_263K_P.cif
DOI: 10.60507/fk2/6n5lf1/qr7oam
title: A2_TlCrP2S7_173K_P.cif
DOI: 10.60507/fk2/6n5lf1/4sef7s
title: A2_TlCrP2S7_93K_P.cif
DOI: 10.60507/fk2/6n5lf1/dcublg
title: A2_TlCrP2S7_213K_C.cif
DOI: 10.60507/fk2/6n5lf1/talna3
title: A2_TlCrP2S7_133K_P.cif
DOI: 10.60507/fk2/6n5lf1/eawlte
title: A5_Cs4[Cr2Cl4(PS4)2]_293K.cif
DOI: 10.60507/fk2/6n5lf1/fu0n5x
title: A3_TlVP2S7_118K_P.cif
DOI: 10.60507/fk2/6n5lf1/mojs3y
title: A1_RbCrP2S7_293K.cif
DOI: 10.60507/fk2/6n5lf1/oapcw0
title: A3_TlVP2S7_153K_C.cif
DOI: 10.60507/fk2/6n5lf1/pdfcih
title: A2_TlCrP2S7_273K_C.cif
DOI: 10.60507/fk2/6n5lf1/yhhb6u
title: A7_Tl4[Cr2Br4(PS4)2]_293K.cif
DOI: 10.60507/fk2/6n5lf1/6xlolg
title: A3_TlVP2S7_148K_C.cif
DOI: 10.60507/fk2/6n5lf1/gidati
title: A3_TlVP2S7_128K_P.cif
DOI: 10.60507/fk2/6n5lf1/mk2ath
title: A2_TlCrP2S7_123K_P.cif
DOI: 10.60507/fk2/6n5lf1/bccboq
title: A3_TlVP2S7_138K_P.cif
DOI: 10.60507/fk2/6n5lf1/pzwepb
title: A2_TlCrP2S7_273K_P.cif
DOI: 10.60507/fk2/6n5lf1/vclbq9
title: A10_TlV2(S2)3PS4_293K.cif
DOI: 10.60507/fk2/6n5lf1/pldx0m
title: A5_Cs4[Cr2Cl4(PS4)2]_133K.cif
DOI: 10.60507/fk2/6n5lf1/0piqqk
title: A6_Tl4[Cr2Cl4(PS4)2]_293K.cif
DOI: 10.60507/fk2/6n5lf1/z5jolb
title: A2_TlCrP2S7_233K_P.cif
DOI: 10.60507/fk2/6n5lf1/jcnrps
title: A3_TlVP2S7_173K_C.cif
DOI: 10.60507/fk2/6n5lf1/pvqgds
title: A2_TlCrP2S7_313K_C.cif
DOI: 10.60507/fk2/6n5lf1/npaghn
title: A2_TlCrP2S7_343K_C.cif
DOI: 10.60507/fk2/6n5lf1/vnpy5s
title: A3_TlVP2S7_113K_P.cif
DOI: 10.60507/fk2/6n5lf1/xmjd8w
title: A2_TlCrP2S7_263K_C.cif
DOI: 10.60507/fk2/6n5lf1/t1ugvp
title: A4_Rb5V(P2S6)2_293K.cif
DOI: 10.60507/fk2/6n5lf1/43zt8r
title: A3_TlVP2S7_158K_C.cif
DOI: 10.60507/fk2/6n5lf1/gje3uw
title: A2_TlCrP2S7_243K_P.cif
DOI: 10.60507/fk2/6n5lf1/kpodjp
title: A2_TlCrP2S7_353K_C.cif
DOI: 10.60507/fk2/6n5lf1/5rbibu
title: A2_TlCrP2S7_143K_P.cif
DOI: 10.60507/fk2/6n5lf1/luzsko
title: A3_TlVP2S7_293K_C.cif
DOI: 10.60507/fk2/6n5lf1/tm1cuz
title: Mueller_Thiophosphates_Readme.txt
DOI: 10.60507/fk2/vzaivf
title: Code for Geometry of Needle-Like Microstructures in Shape-Memory Alloys

description: This repository contains the code to

&lt;a href="https://doi.org/10.1007/s40830-023-00442-0"&gt;Conti, S., Lenz, M., Rumpf, M., Verhülsdonk, J., Zwicknagl, B., Geometry of Needle-Like Microstructures
 in Shape-Memory Alloys. Shap. Mem. Superelasticity (2023).&lt;/a&gt;

Needle-like microstructures are often observed
in shape memory alloys near macro-interfaces that separate
regions with different laminate orientation. We study their
shape with a two-dimensional model based on nonlinear
elasticity, that contains an explicit parametrization of the
needle profiles. Energy minimization leads to specific
predictions for the geometry of needle-like domains. Our
simulations are based on shape optimization of the needle
interfaces, using a polyconvex energy density with cubic
symmetry for the elastic problem, and a numerical implementation
via finite elements on a dynamically changing
grid.
DOI: 10.60507/fk2/vzaivf/f3csvw
title: main.py
DOI: 10.60507/fk2/vzaivf/vwpi3v
title: mesh_setup.py
DOI: 10.60507/fk2/vzaivf/0zgcy9
title: energy_density.py
DOI: 10.60507/fk2/vzaivf/cca9hj
title: deformation.py
DOI: 10.60507/fk2/vzaivf/1dng79
title: license.txt
DOI: 10.60507/fk2/vzaivf/ivkxdx
title: readme.md
DOI: 10.60507/fk2/vzaivf/ajzacu
title: shape_optimization.py
DOI: 10.60507/fk2/vzaivf/5so6ws
title: environment.yml
DOI: 10.60507/fk2/bl618y
title: 3D-Model of Medieval Vilvenich Chapel, Rhineland

description: Der Datensatz zeigt ein 3D-Modell der Kapelle voon Vilvenich

Die Kapelle von Vilvenich, Kreis Düren, war bis zu ihrer Abtragung 2010 eine der letzten, weitgehend im Baubestand erhaltenen Saalkirchen der Rheinischen Börde. Bevor 2015 bis 2017 Grabungen durch die Universität Bonn stattfanden, wurde eine Bauaufnahme des durchgeführt. Dank der Stiftung zur Förderung der Archäologie im Rheinischen Braunkohlenrevier sind die Ergebnisse nun ausgewertet. Auf eine römerzeitliche und merowingerzeitliche Nutzung folgte im 10./11. Jh. der Bau einer Saalkirche mit kurzem oder langem Hauptschiff. Ihr ging vermutlich eine Holzkirche voraus. Im späten 12. Jh. fügte man ein Seitenschiff hinzu, welches später zurückgebaut wurde. Befunde einer Gussanlage zeigen, dass die Kirche eine Bronzeglocke besaß. Der Friedhof umfasst rund 120 Gräber, vorrangig des 9. bis 12. Jhs. In der Neuzeit erfolgten Umbau- und Sanierungsmaßnahmen, wie der Bau von Stützpfeilern und -mauern, sowie eines Portals (1731) und die Erneuerung des Dachstuhls nach Schäden durch den Zweiten Weltkrieg.
description: Blender, 4.0
DOI: 10.60507/fk2/bl618y/umrbqp
title: Medieval_Vilvenich_Chapel_Rhineland.glb
DOI: 10.60507/fk2/bl618y/bq4h9b
title: LANG_3D-Model-of-Medieval-Vilvenich-Chapel__Readme.txt
DOI: 10.60507/fk2/mzieli
title: Long-term phenology observations for temperate fruit trees in the Mediterranean region (and Germany)
title: A dataset compiled by the AdaMedOr project

description: This dataset contains phenological observations made for temperate fruit and nut tree species in Morocco, Tunisia, Spain, and Germany. Phenology observations include mostly different stages of bloom but in a few cases also fruit ripening. Covered fruit tree species include stone fruit (apricot, sweet cherry, plum, peach), pome fruit (apple, pear), nut (almond, pistachio), and olive. The dataset includes observations made for more than 270 different cultivars. Observations were made in commercially managed orchards. Additionally, the dataset contains daily temperature observations for some of the covered locations.
description: R, 4.1.3
description: RStudio, RStudio 2024.04.0+735 "Chocolate Cosmos" Release (a00d0e775dbc93e0d79a1bf474e3e8e8de677383, 2024-04-24) for windows Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) RStudio/2024.04.0+735 Chrome/120.0.6099.291 Electron/28.2.6 Safari/537.36, Quarto 1.4.553
description: Microsoft Excel, 2404
DOI: 10.60507/fk2/mzieli/eubhcl
title: Luedeling_Phenology-fruit-trees_Readme.txt
DOI: 10.60507/fk2/mzieli/mw8rfj
title: 99_clean_pheno_data.R
DOI: 10.60507/fk2/mzieli/rswbvy
title: 98_combined_phenological_data_adamedor_raw.csv
DOI: 10.60507/fk2/mzieli/bwonb4
title: 07_sfax.csv
DOI: 10.60507/fk2/mzieli/ql9xzw
title: 02_coordinates_weatherstations.csv
DOI: 10.60507/fk2/mzieli/vxtleb
title: 03_cieza.csv
DOI: 10.60507/fk2/mzieli/9l0rbc
title: 08_zaragoza.csv
DOI: 10.60507/fk2/mzieli/m348qa
title: 04_klein-altendorf.csv
DOI: 10.60507/fk2/mzieli/7wysqt
title: 05_meknes.csv
DOI: 10.60507/fk2/mzieli/bualxb
title: 01_combined_phenological_data_adamedor_clean.csv
DOI: 10.60507/fk2/mzieli/jbaol2
title: 98_combined_phenological_data_adamedor_raw.csv
DOI: 10.60507/fk2/mzieli/kvhipd
title: 06_santomera.csv
DOI: 10.60507/fk2/mzieli/0ku11w
title: 99_clean_pheno_data.R
DOI: 10.60507/fk2/esz1qz
title: Hard to Solve Instances of the Euclidean Traveling Salesman Problem

description: In our paper Hard to Solve Instances of the Euclidean Traveling Salesman Problem (Mathematical Programming Computation (2021) 13:51-74) we construct a family of Euclidean instances for the Traveling Salesman Problem for which the integrality ratio of the subtour LP converges to 4/3. These instances turn out to be very hard to solve with exact TSP solvers. On a 200 vertex instance from our family, Concorde, the fastest known exact TSP solver, needs more than 1,000,000 times the runtime it needs for TSPLIB instances of similar size. On a 1000 vertex instance the runtime factor is already about 10^27. Here we provide instances with up to 200 vertices 
from our family in TSPLIB format. We also provide code for generating these instances for an arbitrary number of vertices. Finally we make all the .log-files available of the runs of Concorde we describe in our paper.
DOI: 10.60507/fk2/mzieli/dbywgf
title: 01_combined_phenological_data_adamedor_clean.csv
DOI: 10.60507/fk2/apiqce
title: Geometry generation code for "Isogeometric multilevel quadrature for forward and inverse random acoustic scattering"

description: This is the code to generate the computational geometries in

Isogeometric multilevel quadrature for forward and inverse random acoustic scattering. J. Dölz, H. Harbrecht, C. Jerez-Hanckes, and M. Multerer. Computer Methods in Applied Mechanics and Engineering, 388:114242, 2022.
https://dx.doi.org/10.1016/j.cma.2021.114242

In combination with the software package Bembel hosted on https://temf.github.io/bembel/ , the geometries allow to replicate the numerical experiments of the paper.
DOI: 10.60507/fk2/apiqce/05wopd
title: code.zip
DOI: 10.60507/fk2/apiqce/hkram6
title: COPYING
DOI: 10.60507/fk2/apiqce/hyddpp
title: README
DOI: 10.60507/fk2/s27iob
title: TeX source code of the dissertation "Kondo Collapse and Revival by Pulsed Light"

description: The LaTeX source code for the PhD dissertation titled "Kondo Collapse and Revival by Pulsed Light". It provides all the necessary files and scripts to compile the complete document.
DOI: 10.5281/zenodo.14674617
title: TWINS dataset used for experiment in the paper How to select predictive models for causal inference ?

description: Dataset obtained form the shalit-lab github and used in our experiments. Raw url for the dataset : "https://raw.githubusercontent.com/shalit-lab/Benchmarks/master/Twins/Final_data_twins.csv".

Explanation on the dataset : 

 Louizos et al. (2017) introduced the Twins dataset as an augmentation of the    real data on twin births and twin mortality rates in the USA from 1989-1991    (Almond et al., 2005). The treatment is "born the heavier twin" so, in one    sense, we can observe both potential outcomes. Louizos et al. (2017) create an    observational dataset out of this by hiding one of the twins (for each pair) in    the dataset. To ensure there is some confounding, Louizos et al. (2017)    simulate the treatment assignment (which twin is heavier) as a function of the    GESTAT10 covariate, which is the number of gestation weeks prior to birth.    GESTAT10 is highly correlated with the outcome and it seems intuitive that it    would be a cause of the outcome, so this should simulate some confounding.    They simulate this "treatment" with a sigmoid model based on GESTAT10 (number of gestation weeks before birth) and x, the 45 other covariates:    $\mathbf{t}_{i} \mid \mathbf{x}_{i}, \mathbf{z}_{i} \sim \operatorname{Bern}\left(\sigma\left(w_{o}^{\top} \mathbf{x}+w_{h}(\mathbf{z} / 10-0.1)\right)\right) \quad with \; w_{o} \sim \mathcal{N}(0,0.1 \cdot I), w_{h} \sim \mathcal{N}(5,0.1)$    Furthermore, to make sure the twins are very similar, they limit    the data to the twins that are the same sex. To look at data with higher    mortality rates, they further limit the dataset to twins that were born weighing    less than 2 kg.

    References:

        Almond, D., Chay, K. Y., & Lee, D. S. (2005). The costs of low birth weight.            The Quarterly Journal of Economics, 120(3), 1031-1083.

        Louizos, C., Shalit, U., Mooij, J. M., Sontag, D., Zemel, R., & Welling, M.            (2017). Causal effect inference with deep latent-variable models. In            Advances in Neural Information Processing Systems (pp. 6446-6456).        B. Neal, C.-W. Huang, et S. Raghupathi. RealCause: Realistic Causal Inference Benchmarking. arXiv:2011.15007 [cs, stat], march 2021
DOI: 10.5281/zenodo.14674618
title: TWINS dataset used for experiment in the paper How to select predictive models for causal inference ?

description: Dataset obtained form the shalit-lab github and used in our experiments. Raw url for the dataset : "https://raw.githubusercontent.com/shalit-lab/Benchmarks/master/Twins/Final_data_twins.csv".

Explanation on the dataset : 

 Louizos et al. (2017) introduced the Twins dataset as an augmentation of the    real data on twin births and twin mortality rates in the USA from 1989-1991    (Almond et al., 2005). The treatment is "born the heavier twin" so, in one    sense, we can observe both potential outcomes. Louizos et al. (2017) create an    observational dataset out of this by hiding one of the twins (for each pair) in    the dataset. To ensure there is some confounding, Louizos et al. (2017)    simulate the treatment assignment (which twin is heavier) as a function of the    GESTAT10 covariate, which is the number of gestation weeks prior to birth.    GESTAT10 is highly correlated with the outcome and it seems intuitive that it    would be a cause of the outcome, so this should simulate some confounding.    They simulate this "treatment" with a sigmoid model based on GESTAT10 (number of gestation weeks before birth) and x, the 45 other covariates:    $\mathbf{t}_{i} \mid \mathbf{x}_{i}, \mathbf{z}_{i} \sim \operatorname{Bern}\left(\sigma\left(w_{o}^{\top} \mathbf{x}+w_{h}(\mathbf{z} / 10-0.1)\right)\right) \quad with \; w_{o} \sim \mathcal{N}(0,0.1 \cdot I), w_{h} \sim \mathcal{N}(5,0.1)$    Furthermore, to make sure the twins are very similar, they limit    the data to the twins that are the same sex. To look at data with higher    mortality rates, they further limit the dataset to twins that were born weighing    less than 2 kg.

    References:

        Almond, D., Chay, K. Y., & Lee, D. S. (2005). The costs of low birth weight.            The Quarterly Journal of Economics, 120(3), 1031-1083.

        Louizos, C., Shalit, U., Mooij, J. M., Sontag, D., Zemel, R., & Welling, M.            (2017). Causal effect inference with deep latent-variable models. In            Advances in Neural Information Processing Systems (pp. 6446-6456).        B. Neal, C.-W. Huang, et S. Raghupathi. RealCause: Realistic Causal Inference Benchmarking. arXiv:2011.15007 [cs, stat], march 2021
DOI: 10.60507/fk2/q2ve6x
title: Source code of "KadanoffBaym.jl", an adaptive solver for KadanoffBaym equations

description: A permanent storage of "KadanoffBaym.jl", a code developed for the PhD thesis titled "Kondo Collapse and Revival by Pulsed Light." This Julia package implements an adaptive solver for the Kadanoff-Baym equations, used to simulate nonequilibrium dynamics in quantum many-body systems. The repository includes well-documented source code, example scripts, and usage instructions.
DOI: 10.60507/fk2/njvznp
title: Supporting Information for manuscript: Contrasting responses to climate change – predicting bloom of major temperate fruit tree species in the Mediterranean region and Central Europe
title: PhenoFlex model parameters, model performance, generated weather

description: This dataset contains model parameters for the PhenoFlex phenology framework. The parameters were calculated for a subset of the dataset "Long-term phenology observations for temperate fruit trees in the Mediterranean region (and Germany)" (DOI: https://doi.org/10.60507/FK2/MZIELI). The code to calculate the model parameters can be found in the following GitHub repository: https://github.com/larscaspersen/AdaMedOr_climate-change-projections. 

The parameters will be part of a manuscript that will be submitted soon.
DOI: 10.60507/fk2/bwsjze
title: :unav

description: :unav
DOI: 10.60507/fk2/bwsjze/9lzop9
title: :unav

description: :unav
DOI: 10.60507/fk2/bwsjze/fhqu7y
title: :unav

description: :unav
DOI: 10.60507/fk2/bwsjze/ygi73c
title: :unav

description: :unav
DOI: 10.60507/fk2/bwsjze/xtvnjw
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5
title: :unav

description: :unav
DOI: 10.60507/fk2/bwsjze/s3a0xb
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/5dujkm
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/6zasaa
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/fs0vv0
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/2zydko
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/ca5cna
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/b54ths
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/7xjwnu
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/zqgwop
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/4yniy8
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/xntw51
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/qjdnqs
title: :unav

description: :unav
DOI: 10.60507/fk2/7kmya5/txy6or
title: :unav

description: :unav
DOI: 10.60507/fk2/fc0zkd
title: :unav

description: :unav
DOI: 10.60507/fk2/fc0zkd/5fncv5
title: :unav

description: :unav
DOI: 10.60507/fk2/fc0zkd/nhcmdq
title: :unav

description: :unav
DOI: 10.60507/fk2/fc0zkd/jigsjd
title: :unav

description: :unav
DOI: 10.60507/fk2/fc0zkd/asmbrj
title: :unav

description: :unav
DOI: 10.60507/fk2/fc0zkd/cb0jlz
title: :unav

description: :unav
DOI: 10.60507/fk2/fc0zkd/sk4gml
title: :unav

description: :unav
DOI: 10.60507/fk2/fc0zkd/laon7f
title: :unav

description: :unav
DOI: 10.60507/fk2/x22bkr
title: BonnTour: benchmarks & solutions for vehicle routing with time-dependent travel times

description: 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 data retrieved from Uber Movement, (c) 2022 Uber Technologies, Inc., https://movement.uber.com, under a Creative Commons Attribution Non-Commercial license.

The solutions reported in the related publication 
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen:
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks.
Discrete Optimization, Volume 53, 2024, 100848.
are also contained.

This repository is a snapshot of &lt;a href="https://gitlab.com/muelleratorunibonnde/vrptdt-benchmark"&gt;https://gitlab.com/muelleratorunibonnde/vrptdt-benchmark&lt;/a&gt; (git revision: 1306f4b22a5ecf3307ed), i.e. the version that was used in the above publication.
DOI: 10.60507/fk2/x22bkr/p0bvzn
title: vrptdt-benchmark-main.tar.bz2

description: Archive file with the BonnToure benchmark data from https://gitlab.com/muelleratorunibonnde/vrptdt-benchmark
git revision: 1306f4b22a5ecf3307edcce3962c47c7f122adea
DOI: 10.60507/fk2/hw5i1o
title: Vizualization of the temple of Ptolemy XII in Athribis (Egypt)

description: The animation shows the temple of Ptolemy XII in Atrhibis (Egypt). The animation was created from a colored laser scan.

The data set was created as part of the Athribis project at the University of Tübingen, led by Christian Leitz.
description: Bentley Pointools
DOI: 10.60507/fk2/rmu7io
title: Laserscan of the temple of Ptolemy XII in Athribis

description: The data set contains a complete colorized laser scan of the temple of Ptolemy XII in Athribis in Upperegypt (Egypt).
description: Leica Cyclone
description: Autodesk Recap
DOI: 10.60507/fk2/rmu7io/4cywix
title: LANG_Athribis_Laserscan_readme.txt
DOI: 10.60507/fk2/rmu7io/dwfdzh
title: Temple_Athribis_TLS_all.zip