psanse / CliSATLinks
An exact algorithm for the maximum clique problem (MCP) which improves over state-of-the-art approaches in some cases by orders of magnitude
☆14Updated 2 months ago
Alternatives and similar repositories for CliSAT
Users that are interested in CliSAT are comparing it to the libraries listed below
Sorting:
- Reinforcement Learning for Cut Selection☆12Updated 3 years ago
- A standalone local search solver for general mixed integer programming☆45Updated last month
- Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)☆24Updated 3 years ago
- A C++ Framework for Optimization☆36Updated this week
- A standalone local search solver for general integer linear programming☆16Updated last year
- Interactive Performance Evaluation Tools for Optimization Software☆28Updated 2 years ago
- Feasibility Pump Collection☆16Updated 2 years ago
- Representing CP problems as graphs☆20Updated last year
- Bucket Graph Labeling Algorithm for Vehicle Routing☆20Updated 11 months ago
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem☆28Updated 7 months ago
- MIP 2024 Computational Competition☆18Updated 2 years ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆35Updated 9 months ago
- Nutmeg – a MIP and CP branch-and-check solver☆31Updated 2 years ago
- Python interface to automatically formulate Machine Learning models into Mixed-Integer Programs☆39Updated 8 months ago
- Parallel Presolve for Integer and Linear Optimization☆84Updated last week
- A solver based on column generation☆39Updated last month
- A set of reusable components for fast prototyping CVRP heuristic solution approaches.☆19Updated 6 months ago
- A Library of Optimization Problem Libraries☆50Updated 4 years ago
- WIP: Tune the hyperparameters of Google's OR-Tools' CP-SAT solver for specific models☆22Updated 4 months ago
- A more scalable version of FILO.☆31Updated 3 weeks ago
- Quickstart for EURO Meets NeurIPS 2022 Vehicle Routing Competition☆100Updated 2 years ago
- A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem☆16Updated 2 years ago
- A package for tree-based statistical estimation and inference using optimal decision trees.☆41Updated last year
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆19Updated 3 years ago
- Visual representation of the branch-and-cut tree of SCIP using spatial dissimilarities of LP solutions☆30Updated 3 years ago
- Source code associated with the paper "Deep Learning for Data-Driven Districting-and-Routing", authored by A. Ferraz, Q. Cappart, and T. …☆27Updated 7 months ago
- Discrete Optimization is a python library to ease the definition and re-use of discrete optimization problems and solvers.☆77Updated this week
- Fork of the Concorde TSP solver with an easier build procedure☆15Updated last year
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆17Updated 3 years ago
- An open-source Python package to solve Inverse Optimization problems.☆18Updated last year