406 search results - page 17 / 82 » Gadgets, Approximation, and Linear Programming |
DAM
2010
14 years 11 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
EUSFLAT
2003
15 years 1 months ago
2003
We revise the classic methodology to find the multi-product break-even point. In the current paper we propose a solution to the problem under uncertainty conditions, based on DurÃ...
SAC
2010
ACM
15 years 6 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
VLSID
2007
IEEE
16 years 3 days ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
120
click to vote
MOR
2000
14 years 11 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...