54 search results - page 8 / 11 » Approximability of Integer Programming with Generalised Cons... |
67
Voted
STOC
1995
ACM
15 years 1 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
84
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
88
Voted
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
COR
2008
14 years 9 months ago
2008
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...