# LP-type problem

## Papers overview

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

2014

2014

- Symposium on Computational Geometry
- 2014

Random sampling is an important tool in optimization subject to finitely or infinitely many constraints. Here we are interestedâ€¦Â (More)

Is this relevant?

2012

2012

- ICALP
- 2012

In this paper, we revisit the classical k-median problem. Using the standard LP relaxation for k-median, we give an efficientâ€¦Â (More)

Is this relevant?

2009

2009

- Discrete & Computational Geometry
- 2009

LP-type problems is a successful axiomatic framework for optimization problems capturing, e.g., linear programming and theâ€¦Â (More)

Is this relevant?

2009

2009

- ALENEX
- 2009

Certain geometric optimization problems, for example finding the smallest enclosing ellipse of a set of points, can be solved inâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- UAI
- 2008

Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphicalâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- NIPS
- 2007

We present a novel message passing algorithm for approximat ing the MAP problem in graphical models. The algorithm is similar inâ€¦Â (More)

Is this relevant?

2006

2006

- 2006

LP-type problems are an abstract model of linear programming. For some applications it is useful to have LP-type problemsâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- VLDB
- 2004

Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-normsâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Social Choice and Welfare
- 2001

We analyze the core of a class of coalition formation game in which every playerâ€™s payoff depends only on the members of herâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Math. Program.
- 1991

In this paper we report on a cutting plane procedure with which we solved symmetric travelling salesman problems of up to 1000â€¦Â (More)

Is this relevant?