48 search results - page 6 / 10 » Low-Dimensional Linear Programming with Violations |
MP
2006
13 years 7 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— With the growth of mobile users and the increasing deployment of wireless access network infrastructures, the issue of quality of service is becoming an important component of ...
COMPGEOM
1998
ACM
13 years 11 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
MP
2010
13 years 5 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
- Redundant via insertion and line end extension employed in the post-routing stage are two well known and highly recommended techniques to reduce yield loss due to via failure. Ho...