"The min-max close-enough arc routing problem."

Nicola Bianchessi et al. (2022)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2021.10.047

access: open

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/eor/BianchessiCPRS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/BianchessiCPRS22
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis:
The min-max close-enough arc routing problem. Eur. J. Oper. Res. 300(3): 837-851 (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.