427 search results - page 3 / 86 » A Subexponential Bound for Linear Programming |
EOR
2006
13 years 5 months ago
2006
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The linear programming method is applied to the space Un(C) of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theore...
ECCC
2007
13 years 5 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
CPAIOR
2007
Springer
13 years 12 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...