A correction of the justification of the Dietrich-escudero-garín-pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
Year of publication: |
1995
|
---|---|
Authors: | Muñoz, S. |
Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 3.1995, 1, p. 161-165
|
Publisher: |
Springer |
Subject: | Cliques | covers | knapsack constraints |
-
Dietrich, B., (1993)
-
A note for tightening 0–1 models
Escudero, Laureano, (2000)
-
Some properties of cliques in 0–1 mixed integer programs
Escudero, L., (1996)
- More ...
-
On identifying dominant cliques
Escudero, L.F., (2003)
-
On characterizing tighter formulations for 0-1 programs
Escudero, L.F., (1998)
-
An approach for solving a modification of the extended rapid transit network design problem
Escudero, L., (2009)
- More ...