Find your next solver
A curated index of Operations Research resources — solvers, courses, books, datasets, communities and more. Classified by type, topic and audience.
37 resources matching
- Advanced modeling for discrete optimizationCourse
Course about advanced modeling for discrete optimization, covering topics such as debugging or predicates
- Andreas Emil FeldmannContent creator
Optimization Expert | Algorithm Design | Operations Research
- ArcadeTSPGame
An arcade-style TSP challenge game written for https://github.com/tunnuz/arcadetsp's 2018 Christmas Party, follow the in-game instructions.
- Basic modeling for discrete optimizationCourse
Course about basic modeling for discrete optimization with MiniZinc
- 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.
- Choco solverSolver
An Open-Source java library for constraint programming
- ChuffedSolver
Chuffed is a state of the art lazy clause solver designed from the ground up with lazy clause generation in mind.
- Combinatorial Optimization: Algorithms and ComplexityBook
An introduction to algorithms and computational complexity to solve combinatorial optimization problems
- CP ConferenceConference
International conference about Constraint Programming
- CPAIORConference
International conference about the integration of Constraint Programming, Artificial Intelligence and Operations Research
- CSPlibDataset
CSPLib is a library of test problems for constraint solvers.
- DIMACS challengeChallenge
Challenges from the Center for Discrete Mathematics and Theoretical Computer Science
- Discrete Applied MathematicsJournal
Journal covering algorithmic and applied areas of discrete mathematics
- Discrete Optimization courseCourse
Course about discrete optimization covering a wide range of optimization techniques such as Constraint Programming, Local Search or Column Generation
- Flexciton newsBlog
Blog with news from one of the biggest companies in the world optimizing chip making
- Free the world from wasteful scheduling with Timefold AIVideo
Solve NP-hard optimization problems with Timefold AI.
- GecodeSolver
Gecode is an open source C++ toolkit for developing constraint-based systems and applications. Gecode provides a constraint solver with state-of-the-art performance while being modular and extensible.
- Geoffrey De SmetContent creator
Co-Founder + CTO at Timefold AI.
- HuubSolver
Huub is a Lazy Clause Generation (LCG) solver with a focus on modularity and maintainability in addition to speed. LCG solvers are a class of solvers that can be used to solve decision and optimization problems. They are characterized by their ability to dynamically add new Boolean variables and clauses to a Boolean Satisfiability (SAT) solver during the search process
- Jeffrey Dean KellyContent creator
J.D. Kelly is an Advanced Planning and Scheduling (APS) and Advanced Process Control (APC) expert in the process industries including both optimization and estimation technologies otherwise known as Advanced Production-chain Control, Optimization and Estimation (APCOE)
- KalisSolver
An innovative constraints programming component able to solve quickly and efficiently a wide range of combinatorial problems relying on an interactive and user-friendly hybrid framework including constraint programming, mixed-integer programming and artificial intelligence.
- Learn Graph TheoryGame
Interactive resources to learn Graph Theory.
- Meinolf SellmanContent creator
Creator of Optimization Solvers, CEO at InsideOpt.
- MiniZincModeling language
MiniZinc is a high-level constraint modelling language that allows you to easily express and solve discrete optimisation problems.
- PACE challengeChallenge
Challenge from Parameterized Algorithms and Computational Experiments Challenge to bridge the gap between theory and practice of algorithms
- PlannedNewsletter
Planning education for real-world stuff, the newsletter for problem solvers at scale.
- QAPlibDataset
Instances for Quadratic Assignment Problems.
- SNDlibDataset
SNDlib is a library of data for Survivable fixed telecommunication Network Design. Its purpose is to provide data about realistic telecommunication networks (including traffic) available to the research community.
- Solving algorithms for discrete optimizationCourse
Course about solving discrete optimization problems with different techniques: Constraint Programming, Mixed Integer Programming and Local Search
- Timefold AISolver
Updated fork from OptaPlanner
- Timefold use casesUse cases
Customer stories of companies using Timefold for planning problems
- TSP ChallengeGame
Another game with map visualizations for the TSP.
- TSP GameGame
Solve the TSP in a visual way from the Productions and Operations Management (Universitat Wein).
- TSPlibDataset
TSPLIB is a library of sample instances for the TSP (and related problems) from various sources and of various types.
- UnoSolver
Uno (Unifying Nonlinear Optimization) is a C++ library that unifies methods for solving nonlinearly constrained optimization problems.
- Warren PowellContent creator
Professor Emeritus, Princeton University/ Co-Founder, Optimal Dynamics, shares knowledge about sequential decision problems.
- Z3Solver
Z3 is a theorem prover from Microsoft Research.