Note---Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems
Year of publication: |
1982
|
---|---|
Authors: | Granot, Frieda |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 28.1982, 7, p. 829-836
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | programming: integer algorithms | heuristic |
-
Pivot and Complement--A Heuristic for 0-1 Programming
Balas, Egon, (1980)
-
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, Marshall L., (1981)
-
Lee, Jae Sik, (1988)
- More ...
-
Covering relaxation for positive O-1 polynomial programs
Granot, Daniel, (1979)
-
On competitive sequential location in a network with a decreasing demand intensity
Granot, Daniel, (2010)
-
Multicommodity production planning : qualitative analysis and applications
Ciurria-Infosino, Iara, (2015)
- More ...