Efficient pruning technique based on linear relaxations

Authors:
Yahia Lebbah;Claude Michel;Michel Rueher
Affiliations:
COPRIN (I3S/CNRS – INRIA), Université de Nice–Sophia Antipolis, Sophia Antipolis Cedex, France;COPRIN (I3S/CNRS – INRIA), Université de Nice–Sophia Antipolis, Sophia Antipolis Cedex, France;COPRIN (I3S/CNRS – INRIA), Université de Nice–Sophia Antipolis, Sophia Antipolis Cedex, France
Venue:
COCOS'03 Proceedings of the Second international conference on Global Optimization and Constraint Satisfaction
Year:
2003

Citing 15
Cited 1

Recognition problems for special classes of polynomials in 0-1 variables

Mathematical Programming: Series A and B
The convergence rate of the sandwich algorithm for approximating convex functions

Computing
CLP(intervals) revisited

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Solving Polynomial Systems Using a Branch and Prune Approach

SIAM Journal on Numerical Analysis
Revising hull and box consistency

Proceedings of the 1999 international conference on Logic programming
Comparison of Two Reformulation-Linearization TechniqueBased Linear Programming Relaxations for Polynomial Programming Problems

Journal of Global Optimization
A Convex Envelope Formula for Multilinear Functions

Journal of Global Optimization
Global Optimization of Nonconvex Polynomial Programming Problems HavingRational Exponents

Journal of Global Optimization
Analysis of Bounds for Multilinear Functions

Journal of Global Optimization
A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Safe bounds in linear and mixed-integer linear programming

Mathematical Programming: Series A and B
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

Mathematical Programming: Series A and B
Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)

Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)
Consistency techniques for numeric CSPs

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems

Operations Research Letters

Contractor programming

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends the Quad-filtering algorithm for handling general nonlinear systems. This extended algorithm is based on the RLT (Reformulation-Linearization Technique) schema. In the reformulation phase, tight convex and concave approximations of nonlinear terms are generated, that's to say for bilinear terms, product of variables, power and univariate terms. New variables are introduced to linearize the initial constraint system. A linear programming solver is called to prune the domains. A combination of this filtering technique with Box-consistency filtering algorithm has been investigated. Experimental results on difficult problems show that a solver based on this combination outperforms classical CSP solvers.