Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Ram...
This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
In the past few years, a number of constraint languages for XML documents has been proposed. They are cumulatively called schema languages or validation languages and they compris...
Claudio Sacerdoti Coen, Paolo Marinelli, Fabio Vit...
—A principal challenge in modern computational finance is efficient portfolio design – portfolio optimization followed by decision-making. Optimization based on even the widely...
Raj Subbu, Piero P. Bonissone, Neil Eklund, Sriniv...