Algorithms for the Minmax Regret Path problem with interval data

dc.creatorPerez-Galarce, Francisco
dc.creatorCandia-Vejar, Alfredo
dc.creatorAstudillo, Cesar
dc.creatorBardeen, Matthew
dc.date.accessioned2020-01-20T19:41:01Z
dc.date.available2020-01-20T19:41:01Z
dc.date.created2020-01-20T19:41:01Z
dc.date.issued2018
dc.identifier10.1016/j.ins.2018.06.016
dc.identifier0020-0255
dc.identifierhttps://doi.org/10.1016/j.ins.2018.06.016
dc.identifierhttps://repositorio.uc.cl/handle/11534/27693
dc.languageen
dc.rightsacceso restringido
dc.subjectMinmax Regret Model withinterval data
dc.subjectSimulated annealing
dc.subjectShortest path problem
dc.subjectBranch and cut
dc.subjectNeighbourhoods for path problems
dc.titleAlgorithms for the Minmax Regret Path problem with interval data
dc.typeartículo


Este ítem pertenece a la siguiente institución