"A Hybrid Heuristic for Solving Unconstrained Binary Quadratic Programming ..."

Kien Ming Ng (2007)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2007-12-20

- no documents available
- export record
  dblp key:
  - conf/csc/Ng07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csc/Ng07
Kien Ming Ng:
A Hybrid Heuristic for Solving Unconstrained Binary Quadratic Programming Problems. CSC 2007: 44-47

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.