The dataset consists of 72 files. Each file is a matrix representing a certain size of the problem. MCoverInst* indicates the area to cover. Wherever there is 1 in the matrix, this means the cell mu
This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018) Abstract We present several efficient implementations of the simulated annealing algorithm fo
In addition to the risk-neutral SPDS shown in section Ⅲ, we formulate a two-stage mean-risk SPDS problem (MR- SPDS) handled by the proposed KMDR. The MR-SPDS cannot be directly solved by the commercia
