Volume 21, Number 2, 1987
|Page(s)||105 - 136|
|Published online||06 February 2017|
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
This article has no abstract.
© AFCET 1987
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.