← All resources

Combinatorial Optimization: Algorithms and Complexity

An introduction to algorithms and computational complexity to solve combinatorial optimization problems

Visit Combinatorial Optimization: Algorithms and Complexity

Type: Book
Topic: Combinatorial optimization and graphs
Audience: Researcher

TSPlibDatasetTSPLIB is a library of sample instances for the TSP (and related problems) from various sources and of various types.
Solving algorithms for discrete optimizationCourseCourse about solving discrete optimization problems with different techniques: Constraint Programming, Mixed Integer Programming and Local Search
DIMACS challengeChallengeChallenges from the Center for Discrete Mathematics and Theoretical Computer Science
QAPlibDatasetInstances for Quadratic Assignment Problems.
Andreas Emil FeldmannContent creatorOptimization Expert | Algorithm Design | Operations Research
CG:SHOPChallengeThe 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.