Sciweavers

13841 search results - page 327 / 2769
» Algorithms and Constraint Programming
Sort
View
CP
2005
Springer
16 years 8 days ago
From Linear Relaxations to Global Constraint Propagation
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
Claude-Guy Quimper, Alejandro López-Ortiz
169
Voted
BIRTHDAY
2008
Springer
15 years 8 months ago
Semiring-Based Soft Constraints
The semiring-based formalism to model soft constraint has been introduced in 1995 by Ugo Montanari and the authors of this paper. The idea was to make constraint programming more f...
Stefano Bistarelli, Francesca Rossi
SIAMJO
2010
112views more  SIAMJO 2010»
15 years 1 months ago
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
Zhi-Quan Luo, Shuzhong Zhang
SARA
2009
Springer
16 years 1 months ago
Tightened Transitive Closure of Integer Addition Constraints
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
Peter Z. Revesz
CSCLP
2005
Springer
16 years 6 days ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...