The ROADEF challenge is organized every two years by the French Society of Operations
Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

This paper describes the TPTP problem library and associated infrastructure, from its use of
Clause Normal Form (CNF), via the First-Order Form (FOF) and Typed First-order Form …

There is no standard modelling language for constraint programming (CP) problems. Most
solvers have their own modelling language. This makes it difficult for modellers to …

Abstract We introduce PrefLib: A Library for Preferences; an online resource located at
http://www. preflib. org. With the emergence of computational social choice and an increased …

This paper describes the First-Order Form (FOF) and Clause Normal Form (CNF) parts of the
TPTP problem library, and the associated infrastructure. TPTP v3. 5.0 was the last release …

In the last years decision-focused learning framework, also known as predict-and-optimize,
have received increasing attention. In this setting, the predictions of a machine learning …

The ubiquity of combinatorial optimization problems in our society is illustrated by the novel
application areas for optimization technology, which range from supply chain management …

How close are we to a world where every paper on programming languages is
accompanied by an electronic appendix with machine-checked proofs? We propose an …

The Internet enables computers and (by proxy) humans to communicate at distances and
speeds previously unimaginable. Many of the benefits from this technology are derived from …