Find your next solver
A curated index of Operations Research resources — solvers, courses, books, datasets, communities and more. Classified by type, topic and audience.
4 resources matching
- CG:SHOPChallenge
The CG:SHOP Challenge (Computational Geometry: Solving Hard Optimization Problems) is an annual competition dedicated to tackling specific, difficult geometric optimization problems. Originally established as a workshop at Computational Geometry Week (CG Week) in 2019, the Challenge provides a unique platform where the success of proposed solutions is measured based on computational performance on a set of carefully selected benchmark instances. This focus on empirical evaluation marks a shift from traditional computational geometry research, which often emphasizes theoretical approaches.
- DIMACS challengeChallenge
Challenges from the Center for Discrete Mathematics and Theoretical Computer Science
- Land-Doig CompetitionChallenge
The 2026 Land-Doig MIP Competition is a computational competition hosted by the 2026 Mixed Integer Programming Workshop, offering an opportunity for teams to showcase their practical and computational prowess and fostering innovation in computational MIP. It is named in honor of Ailsa H. Land and Alison G. Harcourt (née Doig), who proposed the first LP-based branch-and-bound algorithm.
- PACE challengeChallenge
Challenge from Parameterized Algorithms and Computational Experiments Challenge to bridge the gap between theory and practice of algorithms