14 search results - page 1 / 3 » How tight is the corner relaxation |
DISOPT
2008
13 years 4 months ago
2008
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
CP
2003
Springer
13 years 10 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
CPAIOR
2006
Springer
13 years 8 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
IJCV
2002
13 years 4 months ago
2002
We present a framework for merging the results of independent featurebased motion trackers using a classification based approach. We demonstrate the efficacy of the framework usin...
NIPS
2008
13 years 6 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...