Dr Peter Chapman P.Chapman@napier.ac.uk
Associate Professor
Drawing Algorithms For Linear Diagrams (Supplementary)
Chapman, Peter; Sim, Kevin
Authors
Dr Kevin Sim K.Sim@napier.ac.uk
Lecturer
Abstract
This folder contains the material to go with the article:
Peter Chapman, Kevin Sim, Huanghao Chen (2021) Drawing Algorithms for Linear Diagrams.
The code, the benchmark set of diagrams, the dataset of algorithms applied to the benchmark set, and the analysis, are all contained.
Citation
Chapman, P., & Sim, K. (2021). Drawing Algorithms For Linear Diagrams (Supplementary). [Data]. https://doi.org/10.17869/enu.2021.2748170
Publication Date | Mar 12, 2021 |
---|---|
Deposit Date | Mar 2, 2021 |
Publicly Available Date | Mar 12, 2021 |
DOI | https://doi.org/10.17869/enu.2021.2748170 |
Public URL | http://researchrepository.napier.ac.uk/Output/2748170 |
Collection Date | Dec 22, 2020 |
Collection Method | Benchmark diagrams were created using Java. |
Files
Drawing Algorithms For Linear Diagrams (Supplementary)
(575 Kb)
Archive
You might also like
A hyper-heuristic ensemble method for static job-shop scheduling.
(2016)
Journal Article
Roll Project Bin Packing Benchmark Problems.
(2015)
Data
A research agenda for metaheuristic standardization.
(2015)
Presentation / Conference Contribution
A Lifelong Learning Hyper-heuristic Method for Bin Packing
(2015)
Journal Article
Downloadable Citations
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search