Online COP heuristic learning code: "Online Learning of Variable Ordering Heuristics for Constraint Optimisation Problems"

doi: 10.4121/17081021.v1
The doi above is for this specific version of this dataset, which is currently the latest. Newer versions may be published in the future. For a link that will always point to the latest version, please use
doi: 10.4121/17081021
Datacite citation style:
Floris Doolaard; Yorke-Smith, Neil (2022): Online COP heuristic learning code: "Online Learning of Variable Ordering Heuristics for Constraint Optimisation Problems". Version 1. 4TU.ResearchData. software. https://doi.org/10.4121/17081021.v1
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
Software

This repository contains the source code for the algorithm designed to learn on-the-fly (variable ordering) heuristics for constraint optimization problems (COPs). To apply heuristics to COPs the Geocde solver is used and adapted.


The corresponding paper is:


Online Learning of Variable Ordering Heuristics for Constraint Optimisation Problems

Floris Doolaard and Neil Yorke‐Smith

Annals of Mathematics and Artificial Intelligence

https://doi.org/10.1007/s10472-022-09816-z

published online 2022


history
  • 2022-11-24 first online, published, posted
publisher
4TU.ResearchData
format
Python, C++, MiniZinc
funding
  • Foundations of Trustworthy AI - Integrating Reasoning, Learning and Optimization (grant code 952215) [more info...] European Commission
organizations
TU Delft, Faculty of Electrical Engineering, Mathematics and Computer Science

DATA

files (7)