# Linear programming relaxation

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- EMNLP
- 2010

This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach reliesâ€¦Â (More)

Is this relevant?

2007

2007

- IEEE Conference on Computer Vision and Patternâ€¦
- 2007

This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its wellâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- IEEE Conference on Computer Vision and Patternâ€¦
- 2007

We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-objectâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Information Theory
- 2005

A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based onâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Information Theory
- 2005

We develop and analyze methods for computing provably optimal maximum a posteriori probability (MAP) configurations for aâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Management Science
- 2004

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.orgâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Operations Research
- 1998

We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.eâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- J. ACM
- 1995

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problemsâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Math. Program.
- 1993

We consider the survivable network design problem the problem of designing, at minimum cost, a network with edge-connectivityâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- SIAM J. Discrete Math.
- 1990

In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into aâ€¦Â (More)

Is this relevant?