Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A MILP-based VND for the min-max regret Shortest Path Tree Problem ..."

Iago A. Carvalho et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2018.03.006

access: closed

type: Journal Article

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/CarvalhoNDV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/CarvalhoNDV18
Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel, Luiz Filipe M. Vieira:
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs. Electron. Notes Discret. Math. 66: 39-46 (2018)

a service of

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.