"Dynamic combinatorial optimisation problems: an analysis of the subset sum ..."

Philipp Rohlfshagen, Xin Yao (2011)

> Home

Details and statistics

DOI: 10.1007/S00500-010-0616-9

access: closed

type: Journal Article

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/soco/RohlfshagenY11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/RohlfshagenY11
Philipp Rohlfshagen, Xin Yao:
Dynamic combinatorial optimisation problems: an analysis of the subset sum problem. Soft Comput. 15(9): 1723-1734 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.