Submission to the heuristic track of pace 2024.
Implementation simulated annealing algorithm for the one-sided crossing minimization problem.
- Getting Started
- [Contributing]
- [Versioning]
- Authors
- License
- Acknowledgments
To get a copy of this software download or clone the GitHub repository.
Download:
wget https://github.com/LuisRusso/pace2024-Heuristic/archive/refs/heads/main.zip
Clone:
git clone https://github.com/LuisRusso/pace2024-Heuristic
This package was tested with arch linux btw, it will most likely work with other Linux distributions and UNIX variants. Some version of the following components must exist in the system.
For Linux:
- C compiler, gcc
- GNU Make
- glibc
- libbsd for arc4random
Execute make
to obtain the project
binary.
make
The binary receives a graph in the input format through stdin
.
./project < 1.gr
- Luís M. S. Russo - Initial work - LuisRusso
See also the list of [contributors] who participated in this project.
This project is licensed under the MIT License - see the LICENSE file for details
-
This software was produced for research that was funded in by national funds through Fundação para a Ciência e Tecnologia (FCT) with reference UIDB/50021/2020.
-
Thanks to PurpleBooth for the README-Template.
-
The grip tool by Joe Esposito was very handy for producing this file.