XCSP3: an integrated format for benchmarking combinatorial constrained problems
We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated
representations of combinatorial constrained problems. This new format is able to deal with …
representations of combinatorial constrained problems. This new format is able to deal with …
Global constraint catalog
N Beldiceanu, M Carlsson, JX Rampon - 2010 - diva-portal.org
This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …
described in terms of graph properties and/or automata and/or first order logical formulae …
Improved filtering for weighted circuit constraints
We study the weighted circuit constraint in the context of constraint programming. It appears
as a substructure in many practical applications, particularly routing problems. We propose a …
as a substructure in many practical applications, particularly routing problems. We propose a …
Exploitation de structures de graphe en programmation par contraintes
JG Fages - 2014 - theses.hal.science
De nombreuses applications informatiques nécessitent de résoudre des problèmes de
décision qui sont difficiles d'un point de vue mathématique. La programmation par …
décision qui sont difficiles d'un point de vue mathématique. La programmation par …
Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks
In this paper, we consider the duty scheduling of sensor activities in wireless sensor
networks to maximize the lifetime. We address full target coverage problems contemplating …
networks to maximize the lifetime. We address full target coverage problems contemplating …
Explaining circuit propagation
KG Francis, PJ Stuckey - Constraints, 2014 - Springer
The circuit constraint is used to constrain a graph represented by a successor for each node,
such that the resulting edges form a circuit. Circuit and its variants are important for various …
such that the resulting edges form a circuit. Circuit and its variants are important for various …
Global constraint catalog, (revision a)
N Beldiceanu, M Carlsson, JX Rampon - 2012 - diva-portal.org
This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …
described in terms of graph properties and/or automata and/or first order logical formulae …
Partial target coverage to extend the lifetime in wireless multi‐role sensor networks
This article studies the effect of partial coverage to extend the lifetime of wireless sensor
networks and introduces a hybrid exact solution strategy that efficiently maximizes network …
networks and introduces a hybrid exact solution strategy that efficiently maximizes network …
Steiner tree problems with side constraints using constraint programming
Abstract The Steiner Tree Problem is a well know NP-complete problem that is well studied
and for which fast algorithms are already available. Nonetheless, in the real world the …
and for which fast algorithms are already available. Nonetheless, in the real world the …
Generalising weighted model counting
P Dilkas - 2023 - era.ed.ac.uk
Given a formula in propositional or (finite-domain) first-order logic and some non-negative
weights, weighted model counting (WMC) is a function problem that asks to compute the …
weights, weighted model counting (WMC) is a function problem that asks to compute the …