A MILP-based VND for the min-max regret shortest path tree problem with interval costs
type: Item
instance of: scholarly article
title: A MILP-based VND for the min-max regret shortest path tree problem with interval costs
zbMATH Open document ID: 1408.90334
author: Iago A. Carvalho
author: Thiago F. Noronha
author: Chistophe Duhamel
author: Luiz F. M. Vieira
publication date: 2018-10-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6951742
zbMATH Keywords: VND
zbMATH Keywords: integer programming
zbMATH Keywords: robust optimization
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: j.endm.2018.03.006
OpenAlex ID: W2796710024
cites work: Spanning Trees and Optimization Problems
Wikidata QID: Q129989386
DOI: 10.1016/J.ENDM.2018.03.006
description: scientific article; zbMATH DE number 6951742