A MILP-based VND for the min-max regret shortest path tree problem with interval costs

DOI10.1016/j.endm.2018.03.006zbMath1408.90334OpenAlexW2796710024WikidataQ129989386 ScholiaQ129989386MaRDI QIDQ1791906

Iago A. Carvalho, Chistophe Duhamel, Thiago F. Noronha, Luiz F. M. Vieira

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.006

zbMATH Keywords

integer programminglocal searchrobust optimizationVND

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty

Cites Work

• Spanning Trees and Optimization Problems

This page was built for publication: A MILP-based VND for the min-max regret shortest path tree problem with interval costs