O(n) Procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternatesB.L. DietrichL.F. Escuderoet al.1993TOP
Strategies for LP-based solving a general class of scheduling problemsL.F. EscuderoG. Pérez1990Trabajos de Investigacion Operativa