270 search results - page 16 / 54 » Constraint relaxation in approximate linear programs |
TSP
2010
13 years 2 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— This paper proposes a novel two-stage optimization method for robust Model Predictive Control (RMPC) with Gaussian disturbance and state estimation error. Since the dis...
LATIN
2010
Springer
13 years 5 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...