O(n) Procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
Year of publication: |
1993
|
---|---|
Authors: | Dietrich, B. ; Escudero, L. ; Garín, A. ; Pérez, G. |
Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 1.1993, 1, p. 139-160
|
Publisher: |
Springer |
Subject: | Cliques | Covers | Extensions | Alternates | Knapsack constraints | 0–1 programs | Tightening |
-
Muñoz, S., (1995)
-
A note for tightening 0–1 models
Escudero, Laureano, (2000)
-
Some properties of cliques in 0–1 mixed integer programs
Escudero, L., (1996)
- More ...
-
Escudero, L., (1996)
-
Some properties of cliques in 0–1 mixed integer programs
Escudero, L., (1996)
-
On the product selection and plant dimensioning problem under uncertainty
Alonso-Ayuso, A., (2005)
- More ...