"Achieving feasibility for clustered traveling salesman problems using ..."

Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern (2023)

> Home

Details and statistics

DOI: 10.1002/NET.22164

access: closed

type: Journal Article

metadata version: 2024-03-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/GuttmannBeckMS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/GuttmannBeckMS23
Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern:
Achieving feasibility for clustered traveling salesman problems using PQ-trees. Networks 82(2): 153-166 (2023)

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.