"On provably best construction heuristics for hard combinatorial ..."

Sera Kahruman-Anderoglu et al. (2016)

> Home

Details and statistics

DOI: 10.1002/NET.21620

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Kahruman-Anderoglu16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Kahruman-Anderoglu16
Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev:
On provably best construction heuristics for hard combinatorial optimization problems. Networks 67(3): 238-245 (2016)

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.