← All resources

PACE challenge

Challenge from Parameterized Algorithms and Computational Experiments Challenge to bridge the gap between theory and practice of algorithms

Visit PACE challenge

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

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.
DIMACS challengeChallengeChallenges from the Center for Discrete Mathematics and Theoretical Computer Science
Solving algorithms for discrete optimizationCourseCourse about solving discrete optimization problems with different techniques: Constraint Programming, Mixed Integer Programming and Local Search
Discrete Applied MathematicsJournalJournal covering algorithmic and applied areas of discrete mathematics
SNDlibDatasetSNDlib 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.
Andreas Emil FeldmannContent creatorOptimization Expert | Algorithm Design | Operations Research