Covering relaxation for positive O-1 polynomial programs
| Year of publication: |
1979
|
|---|---|
| Authors: | Granot, Daniel ; Granot, Frieda ; Kallberg, Jerry |
| Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 25.1979, 3, p. 264-273
|
| Subject: | Programmanalyse ganzzahlig |
-
A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
Palleta, Giuseppe, (1987)
-
Solving 0-1 integer programming problems arising from large scale planning models
Johnson, Ellis L., (1985)
-
A new Lagrangian relaxation approach to the generalized assignment problem
Jörnsten, Kurt, (1986)
- More ...
-
Covering Relaxation for Positive 0-1 Polynomial Programs
Granot, Daniel, (1979)
-
The Reactive Bargaining Set of Some Flow Games and of Superadditive Simple Games
Granot, Daniel, (1998)
-
On competitive sequential location in a network with a decreasing demand intensity
Granot, Daniel, (2010)
- More ...