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
- 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.
- Combinatorial Optimization: Algorithms and ComplexityBook
An introduction to algorithms and computational complexity to solve combinatorial optimization problems
- 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
- Learn Graph TheoryGame
Interactive resources to learn Graph Theory.
- PACE challengeChallenge
Challenge from Parameterized Algorithms and Computational Experiments Challenge to bridge the gap between theory and practice of algorithms
- 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
- 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.