"A constraint-based parallel local search for the edge-disjoint rooted ..."

Alejandro Arbelaez et al. (2018)

> Home

Details and statistics

DOI: 10.1007/S10732-017-9342-0

access: closed

type: Journal Article

metadata version: 2022-04-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/heuristics/ArbelaezMOQ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/heuristics/ArbelaezMOQ18
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem. J. Heuristics 24(3): 359-394 (2018)

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.