Polyhedral Omega for integer programming benchmarks
Test the Polyhedral Omega optimization package on standard ILP benchmark families. Co-supervision with the Athens node is possible.
- Suitable for
- Master's thesis
- Supervision
- Tülay Ayyıldız
- Prerequisites
- Integer programming; programming in Julia
Polyhedral Omega computes rational generating functions of the integer points of polyhedra and can be used to solve integer linear programs (POGA project; ISSAC 2024 software presentation).
Goal
Run Optimization.jl on standard integer programming benchmark families, compare it with branch-and-bound solvers, and identify the problem structures where the generating-function approach is competitive.