Cristina Requejo
Cristina Requejo
Verified email at ua.pt
Title
Cited by
Cited by
Year
The robust vehicle routing problem with time windows
A Agra, M Christiansen, R Figueiredo, LM Hvattum, M Poss, C Requejo
Computers & operations research 40 (3), 856-866, 2013
1762013
On formulations and methods for the hop-constrained minimum spanning tree problem
G Dahl, L Gouveia, C Requejo
Handbook of optimization in telecommunications, 493-515, 2006
912006
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
L Gouveia, C Requejo
European Journal of Operational Research 132 (3), 539-552, 2001
892001
Genetic algorithm for the topological design of survivable optical transport networks
RM Morais, C Pavan, AN Pinto, C Requejo
Journal of optical communications and networking 3 (1), 17-26, 2011
582011
A 2‐path approach for odd‐diameter‐constrained minimum spanning and Steiner trees
L Gouveia, TL Magnanti, C Requejo
Networks: An International Journal 44 (4), 254-265, 2004
452004
Layered formulation for the robust vehicle routing problem with time windows
A Agra, M Christiansen, R Figueiredo, LM Hvattum, M Poss, C Requejo
International Symposium on Combinatorial Optimization, 249-260, 2012
352012
An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem
A Agra, C Requejo, F Rodrigues
Networks 72 (1), 5-24, 2018
132018
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
L Gouveia, TL Magnanti, C Requejo
Annals of Operations Research 146 (1), 19-39, 2006
122006
A block active set algorithm for large-scalequadratic programming with box constraints
L Fernandes, A Fischer, J J˙dice, C Requejo, J Soares
Annals of Operations research 81, 75-96, 1998
121998
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
B Fortz, O Oliveira, C Requejo
European journal of operational research 256 (1), 242-251, 2017
112017
Greedy heuristics for the diameter-constrained minimum spanning tree problem
C Requejo, E Santos
Journal of mathematical sciences 161 (6), 930-943, 2009
112009
Comparing techniques for modelling uncertainty in a maritime inventory routing problem
F Rodrigues, A Agra, M Christiansen, LM Hvattum, C Requejo
European Journal of Operational Research 277 (3), 831-845, 2019
102019
The linking set problem: a polynomial special case of the multiple-choice knapsack problem
A Agra, C Requejo
Journal of Mathematical Sciences 161 (6), 919-929, 2009
102009
Feasibility check for the distance geometry problem: an application to molecular conformations
A Agra, R Figueiredo, C Lavor, N Maculan, A Pereira, C Requejo
International Transactions in Operational Research 24 (5), 1023-1040, 2017
92017
Formulations for the Weight‐Constrained Minimum Spanning Tree Problem
C Requejo, A Agra, A Cerveira, E Santos
AIP Conference Proceedings 1281 (1), 2166-2169, 2010
82010
A hybrid heuristic for a stochastic production-inventory-routing problem
A Agra, C Requejo, F Rodrigues
Electronic Notes in Discrete Mathematics 64, 345-354, 2018
72018
A decomposition approach for the p-median problem on disconnected graphs
A Agra, JO Cerdeira, C Requejo
Computers & Operations Research 86, 79-85, 2017
72017
Using decomposition to improve greedy solutions of the optimal diversity management problem
A Agra, JO Cerdeira, C Requejo
International Transactions in Operational Research 20 (5), 617-625, 2013
52013
On the weight-constrained minimum spanning tree problem
A Agra, A Cerveira, C Requejo, E Santos
International Conference on Network Optimization, 156-161, 2011
52011
Lagrangean based algorithms for the weight-constrained minimum spanning tree problem
C Requejo, E Santos
Agra, Agostinho and Doostmohammadi, Mahdi (2011) A Polyhedral Study of Mixedá…, 2011
42011
The system can't perform the operation now. Try again later.
Articles 1–20