Výsledky vyhledávání - "programming: integer algorithms, heuristic"

Note--Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems Autor Granot, Frieda

“…) problem of finding a 0-1 vector x that maximizes c T x subject to f ( x ) b where c , b 0 and f is an m -vector of polynomials with non-negative coefficients…”
Získat plný text

Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems Autor Granot, Frieda

“…) problem of finding a 0-1 vector x that maximizes cTx subject to f(x) ≤ b where c, b ≥ 0 and f is an m-vector of polynomials with non-negative coefficients…”
Získat plný text