Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

CPAIOR
2007
Springer

favoriteEmaildiscussreport

136views Operations Research» more CPAIOR 2007»

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width

13 years 10 months ago

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width

Download dlev.net

We show how to efﬁciently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs ﬁrst, we show that a Sherali-Adams-like procedure results in a polynomial-size linear programming description of the convex hull of all integer feasible solutions when the BCP that is given has bounded tree-width.

Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal

Real-time Traffic

Binary Constraint Problems | CPAIOR 2007 | Integer Feasible Solutions | Integer Programs |

claim paper

Related Content

» A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Pr...

» ILPBased Scheduling with Time and Resource Constraints in High Level Synthesis

» Exact Bipartite Crossing Minimization under Tree Constraints

» Learning Bayesian Network Structure using LP Relaxations

» Facets of the Complementarity Knapsack Polytope

» The Complexity of Integer Bound Propagation

» Efficient robust optimization for robust control with constraints

» Optimization over state feedback policies for robust control with constraints

» Smoothed analysis of integer programming

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	CPAIOR
Authors	Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal

Comments (0)