Find your next solver
A curated index of Operations Research resources — solvers, courses, books, datasets, communities and more. Classified by type, topic and audience.
17 resources matching
- BKS ChallengeChallenge
The CVRPLIB team announces the CVRPLIB BKS Challenge, a 30-day competition aimed at finding extremely high-quality solutions for the new XL benchmark set, 100 challenging CVRP instances ranging from 1,000 to 10,000 customers.
- 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
- Discrete Optimization TalksPodcast
Discrete Optimization Talks (DOTs) is a virtual seminar series from the Mixed Integer Programming Society (MIPS), a technical section of the Mathematical Optimization Society (MOS). Topics of interest are theoretical, computational, and applied aspects of integer and combinatorial optimization. The typical format of each session is two 30-minute talks.
- Grid Optimization competitionChallenge
Grid Optimization challenges for electric systems
- IISE Operations Research podcast seriesPodcast
It features conversations between students, faculty and professionals around OR-related topics
- 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.
- MOPTA challengeChallenge
Annual challenges from the University of Lehigh
- NeEDS - Network of European Data ScientistsPodcast
The Network consists of six academic and nine industrial participants from five EU countries, USA and Chile. The participants combine strong and complementary expertise, within industry sectors ranging from energy, retailing, insurance to banking, as well as national statistical offices.
- OPTIL.ioChallenge
Challenges with different optimization problems
- PACE challengeChallenge
Challenge from Parameterized Algorithms and Computational Experiments Challenge to bridge the gap between theory and practice of algorithms
- Resoundingly Human - INFORMSPodcast
The podcast from INFORMS that talks about different topics around Operations Research
- ROADEF challengeChallenge
Bi-annual challenges from the French Operational Research (OR) and Decision Support Society. 2026: https://gitlab.com/Orange-OpenSource/network-optimization-tools/challenge-roadef-2026/-/tree/main/sprint_results
- Shell AI challengeChallenge
Annual challenges organized by Shell AI team.
- SMIO ChallengeChallenge
Optimization competition organized by the Mexican Society of Operations Research (SMIO).
- Subject toPodcast
"Subject to" offers a series of informal conversations with relevant figures in the fields of Operations Research, Combinatorial Optimization and Logistics, and they are hosted by Anand Subramanian, an Associate Professor at Universidade Federal da Paraíba (UFPB), Brazil
- VeRoLogChallenge
Vehicle Routing and Logistics work group from EURO