LP-type problem

In the study of algorithms, an LP-type problem (also called a generalized linear program) is an optimization problem that shares certain properties… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
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
In this paper, we revisit the classical k-median problem. Using the standard LP relaxation for k-median, we give an efficient… (More)
  • figure C.1
  • figure C.2
  • figure C.3
Is this relevant?
2009
2009
LP-type problems is a successful axiomatic framework for optimization problems capturing, e.g., linear programming and the… (More)
  • figure 1
  • figure 2
Is this relevant?
2009
2009
Certain geometric optimization problems, for example finding the smallest enclosing ellipse of a set of points, can be solved in… (More)
  • table 1
  • table 2
  • table 4
  • table 3
  • table 5
Is this relevant?
Highly Cited
2008
Highly Cited
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
We present a novel message passing algorithm for approximat ing the MAP problem in graphical models. The algorithm is similar in… (More)
  • figure 1
  • figure 2
Is this relevant?
2006
2006
LP-type problems are an abstract model of linear programming. For some applications it is useful to have LP-type problems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
2001
Highly Cited
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
In this paper we report on a cutting plane procedure with which we solved symmetric travelling salesman problems of up to 1000… (More)
  • figure 3.1
  • table 3.1
  • figure 3.2
  • figure 3.3
  • figure 4.1
Is this relevant?