Alfredo Candia-Véjar

Available identifiers

zbMath Open candia-vejar.alfredoMaRDI QIDQ337032

List of research outcomes

Publication	Date of Publication	Type
Improved robust shortest paths by penalized investments	2021-07-19	Paper
Algorithms for the minmax regret path problem with interval data	2020-09-09	Paper
The multiple team formation problem using sociometry	2016-11-17	Paper
On exact solutions for the minmax regret spanning tree problem	2016-11-10	Paper
Vulnerability Assessment of Spatial Networks: Models and Solutions	2015-10-16	Paper
Risk models for the prize collecting Steiner tree problems with interval data	2014-08-29	Paper
Minmax regret combinatorial optimization problems: an Algorithmic Perspective	2013-04-29	Paper
On a Class of Interval Data Minmax Regret CO Problems	2011-04-07	Paper
Deterministic risk control for cost-effective network connections	2011-01-28	Paper
Worst-case performance of Wong's Steiner tree heuristic	2006-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q5708491	2005-11-18	Paper
An approach for the Steiner problem in directed graphs	1992-06-27	Paper

Research outcomes over time

This page was built for person: Alfredo Candia-Véjar