"Data structures for speeding up Tabu Search when solving sparse quadratic ..."

Ricardo N. Liang, Eduardo A. J. Anacleto, Cláudio N. Meneses (2022)

> Home

Details and statistics

DOI: 10.1007/S10732-022-09498-0

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/heuristics/LiangAM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/heuristics/LiangAM22
Ricardo N. Liang, Eduardo A. J. Anacleto, Cláudio N. Meneses:
Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems. J. Heuristics 28(4): 433-479 (2022)

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.