Software
Software
Implementations of the algorithms in my papers, released with the benchmark instances and computational material needed to reproduce the experiments.
CliSAT
Exact SAT-based algorithm for the Maximum Clique Problem, used to solve hard maximum clique instances, with benchmark instances and computational material.
BPP-NE
Numerically exact branch-price-and-cut solver for the classical Bin Packing Problem, with safe dual bounds and an exact fixed-point pricing algorithm.
NEA-G2KP
Exact solution framework for two-dimensional knapsack problems, with the instances and detailed results of the benchmark study.
Bfilt
Branch-and-filter exact algorithm for Binary Constraint Satisfaction Problems, with a Linux release, benchmark instances and format converters.
KPCG
Combinatorial branch-and-bound for the Knapsack Problem with Conflicts, where selected items must satisfy a capacity constraint and pairwise incompatibilities.
BBEWC
Exact branch-and-bound for the Maximum Edge-Weighted Clique Problem, with the datasets and the executable used in the computational study.
LOC-COV
Branch-and-Benders-cut for the Maximal Covering and Partial Set Covering Location Problems, scaling to millions of demand points.
SUB-COV-MAX
Submodular maximization of concave utility functions composed with a set-union operator, for covering and location models with diminishing returns.
COVER-MAX-DEPTH
Exact separation of cover inequalities of maximum depth for knapsack-constrained problems.
BP-k-VCP
Branch-and-price for the k-Vertex Cut Problem.
Ramsey lower bounds
Integer programming approach to compute lower bounds for Ramsey numbers using circulant graphs.
Benchmark library
Libraries
QPLIB
The reference library of quadratic programming instances — continuous, mixed-integer and binary — curated and classified for benchmarking.
Publication details and available author PDFs are listed on the publications page — see Publications.