usage stats
Totals for datasets (co-)authored by Mathijs de Weerdt
4319
downloads
28950
views
7
shares
3
cites
Mathijs de Weerdt
Datasets
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; varying vertex count, bounded induced width (Figure 4)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Job shop (Figure 7)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - HTN (Figure 8)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Diamonds (Figure 5)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)
- Data underlying the research of Quality prediction of strawberries with RGB image segments
- Network instance Chordal, fixed treewidth, edition 1
- Network instance Chordal, fixed size, edition 2
- Network instance Diamonds, edition 2
- Network instance HTN, edition 2
- Network instance Job shop, edition 2
- Network instance New York, edition 2
- Network instance Scale-free; varying vertex count, bounded induced width, edition 2
- Network instance Scale-free; constant vertex count, varying density, edition 2
- Raw data of the EXPensive Optimization benchmark library (EXPObench)
- Software accompanying the publication: Surrogate DC Microgrid Models for Optimization of Charging Electric Vehicles under Partial Observability
- Source code and data for the experiments presented in Deep Reinforcement Learning for Active Wake Control
- Source code for the article: Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm
- Supplementary data for the article: Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm
- Supplementary data for the article: Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art
