C
Cristina Requejo
Researcher at University of Aveiro
Publications - 37
Citations - 617
Cristina Requejo is an academic researcher from University of Aveiro. The author has contributed to research in topics: Minimum spanning tree & Integer programming. The author has an hindex of 10, co-authored 35 publications receiving 514 citations. Previous affiliations of Cristina Requejo include Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa.
Papers
More filters
Journal ArticleDOI
The robust vehicle routing problem with time windows
Agostinho Agra,Marielle Christiansen,Rosa Figueiredo,Lars Magnus Hvattum,Michael Poss,Cristina Requejo +5 more
TL;DR: This paper addresses the robust vehicle routing problem with time windows by proposing two new formulations for the robust problem, each based on a different robust approach, and develops a new cutting plane technique for robust combinatorial optimization problems with complicated constraints.
Book ChapterDOI
On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem
TL;DR: This chapter presents a general framework for modeling the hopconstrained minimum spanning tree problem (HMST) which includes formulations already presented in the literature and surveys different ways of computing a lower bound on the optimal value.
Journal ArticleDOI
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
TL;DR: The results show that for dense graphs the new Lagrangean relaxation proves to be a reasonable alternative to solving the LP relaxation of the hop-indexed model, and the lower bounds given by the new relaxation dominate the lower limits given by previouslagrangean relaxations.
Journal ArticleDOI
Genetic Algorithm for the Topological Design of Survivable Optical Transport Networks
TL;DR: In this paper, a genetic algorithm for the topological design of survivable optical transport networks with minimum capital expenditure is presented. But the quality of the obtained solutions is assessed using an integer linear programming model.
Journal IssueDOI
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
TL;DR: In this article, the authors presented an alternative model for the situation when the tree diameter D is odd and showed that the linear programming gaps for the tightened model are very small, typically less than 0.5p and are usually one third to one tenth of the gaps of the best previous model described in Gouveia and Magnanti l2003r.