Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems

We develop in this paper two types of heuristic methods for solving the positive 0-1 polynomial programming (PP) 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. The various heuristics were fir...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Management science Ročník 28; číslo 7; s. 829 - 836
Hlavný autor:	Granot, Frieda
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hanover, MD., etc Institute of Management Sciences 01.07.1982 Institute for Operations Research and the Management Sciences
Predmet:	Algorithms Computation Computer programming Constraints Heuristic Heuristic methods Heuristics Input output Integers Linear programming Management science Methodological problems Objective functions Optimal solutions Polynomials Variables Zero
ISSN:	0025-1909, 1526-5501
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!