"A tabu search algorithm for the minmax regret minimum spanning tree ..."

Adam Kasperski, Mariusz Makuchowski, Pawel Zielinski (2012)

> Home

Details and statistics

DOI: 10.1007/S10732-012-9200-Z

access: closed

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/heuristics/KasperskiMZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/heuristics/KasperskiMZ12
Adam Kasperski, Mariusz Makuchowski, Pawel Zielinski:
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data. J. Heuristics 18(4): 593-625 (2012)

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.