Dynamic combinatorial optimisation problems: an analysis of the subset sum problem

Philipp Rohlfshagen, Xin Yao. Dynamic combinatorial optimisation problems: an analysis of the subset sum problem. Soft Comput., 15(9):1723-1734, 2011. [doi]

@article{RohlfshagenY11,
  title = {Dynamic combinatorial optimisation problems: an analysis of the subset sum problem},
  author = {Philipp Rohlfshagen and Xin Yao},
  year = {2011},
  doi = {10.1007/s00500-010-0616-9},
  url = {http://dx.doi.org/10.1007/s00500-010-0616-9},
  tags = {analysis},
  researchr = {https://researchr.org/publication/RohlfshagenY11},
  cites = {0},
  citedby = {0},
  journal = {Soft Comput.},
  volume = {15},
  number = {9},
  pages = {1723-1734},
}