Results 1  10
of
148,173
Geometrically Lpoptimal lines of vertices of an equilateral triangle
, 2011
"... We consider the distances between a line and a set of points in the plane defined by the Lpnorms of the vector consisting of the euclidian distance between the single points and the line. We determine lines with minimal geometric Lpdistance to the vertices of an equilateral triangle for all 1 ≤ p ..."
Abstract
 Add to MetaCart
≤ ∞. The investigation of the Lpdistances for p 6 = 1, 2,∞ establishes the passage between the wellknown sets of optimal lines for p = 1, 2,∞. The set of optimal lines consists of three lines each parallel to one of the triangle sides for 1 ≤ p < 4/3 and 2 < p ≤ ∞ and of the three perpendicular bisectors
Branchandprice: Column generation for solving huge integer programs
 OPER. RES
, 1998
"... We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchandbound tree. We present classes of models for which t ..."
Abstract

Cited by 344 (13 self)
 Add to MetaCart
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchandbound tree. We present classes of models for which
Evaluation of OpenSource LP Optimization Codes in Solving Electricity Spot Market Optimization Problems
"... ABSTRACT. The purpose of this paper is to provide an evaluation of the three opensource LP optimization codes, GLPK, COINLP (CLP) and LPSOLVE in solving electricity spot market optimization problems. The paper describes a technique for automatically generating over 100 locational marginal pricing ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ABSTRACT. The purpose of this paper is to provide an evaluation of the three opensource LP optimization codes, GLPK, COINLP (CLP) and LPSOLVE in solving electricity spot market optimization problems. The paper describes a technique for automatically generating over 100 locational marginal pricing
Adjustable robust solutions of uncertain linear programs
, 2004
"... We consider linear programs with uncertain parameters, lying in some prescribed uncertainty set, where part of the variables must be determined before the realization of the uncertain parameters (“nonadjustable variables”), while the other part are variables that can be chosen after the realization ..."
Abstract

Cited by 356 (12 self)
 Add to MetaCart
the realization (“adjustable variables”). We extend the Robust Optimization methodology ([1, 3–6, 9, 13, 14]) to this situation by introducing the Adjustable Robust Counterpart (ARC) associated with an LP of the above structure. Often the ARC is significantly less conservative than the usual Robust Counterpart
Optimizing Power Using Transformations
 IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems
, 1995
"... : The increasing demand for portable computing has elevated power consumption to be one of the most critical design parameters. A highlevel synthesis system, HYPERLP, is presented for minimizing power consumption in application specific datapath intensive CMOS circuits using a variety of architect ..."
Abstract

Cited by 204 (14 self)
 Add to MetaCart
of computational complexity and structures are optimized and synthesized using the HYPERLP system. The results indicate that more than an order of magnitude reduction in power can be achieved over currentday design methodologies while maintaining the system throughput; in some cases this can be accomplished
Bidding and Allocation in Combinatorial Auctions
 IN ACM CONFERENCE ON ELECTRONIC COMMERCE
, 2000
"... When an auction of multiple items is performed, it is often desirable to allow bids on combinations of items, as opposed to only on single items. Such an auction is often called "combinatorial", and the exponential number of possible combinations results in computational intractability o ..."
Abstract

Cited by 270 (11 self)
 Add to MetaCart
. We then consider the problem of determining the best allocation  a problem known to be computationally intractable. We suggest an approach based on Linear Programming (LP) and motivate it. We prove that the LP approach finds an optimal allocation if and only if prices can be attached to single
A BRANCHANDCUT ALGORITHM FOR THE RESOLUTION OF LARGESCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS
, 1991
"... An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the in ..."
Abstract

Cited by 198 (6 self)
 Add to MetaCart
An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull
Lp Regularized Portfolio Optimization
"... Investors who optimize their portfolios under any of the coherent risk measures are naturally led to regularized portfolio optimization when they take into account the impact their trades make on the market. We show here that the impact function determines which regularizer is used. We also show th ..."
Abstract
 Add to MetaCart
Investors who optimize their portfolios under any of the coherent risk measures are naturally led to regularized portfolio optimization when they take into account the impact their trades make on the market. We show here that the impact function determines which regularizer is used. We also show
MAP estimation via agreement on trees: Messagepassing and linear programming
, 2002
"... We develop and analyze methods for computing provably optimal maximum a posteriori (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex combination of treestructured distributions, we obtain an upper bound ..."
Abstract

Cited by 191 (9 self)
 Add to MetaCart
We develop and analyze methods for computing provably optimal maximum a posteriori (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex combination of treestructured distributions, we obtain an upper bound
LP decoding
 IN PROC. 41ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING
, 2003
"... Linear programming (LP) relaxation is a common technique used to find good solutions to complex optimization problems. We present the method of “LP decoding”: applying LP relaxation to the problem of maximumlikelihood (ML) decoding. An arbitrary binaryinput memoryless channel is considered. This t ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Linear programming (LP) relaxation is a common technique used to find good solutions to complex optimization problems. We present the method of “LP decoding”: applying LP relaxation to the problem of maximumlikelihood (ML) decoding. An arbitrary binaryinput memoryless channel is considered
Results 1  10
of
148,173