Richiedi una copia del documento: A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints

Captcha code
Annulla