← All resources

SNDlib

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.

Type: Dataset
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.
QAPlibDatasetInstances for Quadratic Assignment Problems.
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.
Solving algorithms for discrete optimizationCourseCourse about solving discrete optimization problems with different techniques: Constraint Programming, Mixed Integer Programming and Local Search
Advanced modeling for discrete optimizationCourseCourse about advanced modeling for discrete optimization, covering topics such as debugging or predicates
PACE challengeChallengeChallenge from Parameterized Algorithms and Computational Experiments Challenge to bridge the gap between theory and practice of algorithms