427 search results - page 43 / 86 » A Subexponential Bound for Linear Programming |
29
Voted
CPAIOR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
DISOPT
2008
13 years 7 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
IOR
2007
13 years 7 months ago
2007
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
JMLR
2012
11 years 10 months ago
2012
The development of accurate models and efficient algorithms for the analysis of multivariate categorical data are important and longstanding problems in machine learning and compu...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...