Management Science, Vol. 28, No. 7 (Jul., 1982), pp. 829-836 (8 pages) We develop in this paper two types of heuristic methods for solving the positive 0-1 polynomial programming (PP) problem of ...
This example shows the use of the %PDL macro for polynomial distributed lag models. Simulated data is generated so that Y is a linear function of six lags of X, with the lag coefficients following a ...
Interesting Engineering on MSN
US team finds ‘super-polynomial’ problems that even quantum computers can’t crack
Certain quantum phases, such as topological order, are notoriously difficult for computers to identify. The challenge grows with the correlation length, a measure of how far the p ...
This is a preview. Log in through your library . Abstract The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos [1985] and is based ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results