PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team
Michael J\"unger, Paul J. J\"unger, Petra Mutzel, Gerhard Reinelt
TL;DR
The paper introduces the OSCM solver developed by the MPPEG team for the PACE 2024 challenge, providing an exact solution approach for the one-sided crossing minimization problem, with implementation details available online.
Contribution
It presents the OSCM solver specifically designed for the one-sided crossing minimization problem, advancing exact solution methods in this domain.
Findings
Successfully submitted to PACE 2024 challenge
Achieved exact solutions for benchmark instances
Available implementation online
Abstract
This is a short description of our solver OSCM submitted by our team MPPEG to the PACE 2024 challenge both for the exact track and the parameterized track, available at https://github.com/pauljngr/PACE2024 and https://doi.org/10.5281/zenodo.11546972.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Data Management and Algorithms · Computational Geometry and Mesh Generation