Maria Cristina Saraiva Requejo Agra


AuthID: R-000-ATP

Confirmed Publications: 14



1
TITLE: The robust vehicle routing problem with time windows  Full Text
AUTHORS: Agostinho Agra ; Marielle Christiansen; Rosa Figueiredo ; Lars Magnus Hvattum; Michael Poss; Cristina Requejo ;
PUBLISHED: 2013, SOURCE: COMPUTERS & OPERATIONS RESEARCH, VOLUME: 40, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 62
IN MY: ORCID
2
TITLE: Using decomposition to improve greedy solutions of the optimal diversity management problem  Full Text
AUTHORS: Agostinho Agra ; Jorge Orestes Cerdeira ; Cristina Requejo ;
PUBLISHED: 2013, SOURCE: INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, VOLUME: 20, ISSUE: 5
INDEXED IN: Scopus WOS CrossRef: 5
IN MY: ORCID
3
TITLE: Layered formulation for the robust vehicle routing problem with time windows
AUTHORS: Agra, A ; Christiansen, M; Figueiredo, R ; Magnus Hvattum, L; Poss, M; Requejo, C ;
PUBLISHED: 2012, SOURCE: 2nd International Symposium on Combinatorial Optimization, ISCO 2012 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 7422 LNCS
INDEXED IN: Scopus CrossRef: 4
IN MY: ORCID
4
TITLE: Genetic Algorithm for the Topological Design of Survivable Optical Transport Networks  Full Text
AUTHORS: Morais, RM; Pavan, C; Pinto, AN ; Requejo, C ;
PUBLISHED: 2011, SOURCE: JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, VOLUME: 3, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef Handle
IN MY: ORCID
5
TITLE: On the Weight-Constrained Minimum Spanning Tree Problem
AUTHORS: Agostinho Agra ; Adelaide Cerveira ; Cristina Requejo ; Eulalia Santos;
PUBLISHED: 2011, SOURCE: 5th International Network Optimization Conference (INOC) in NETWORK OPTIMIZATION, VOLUME: 6701
INDEXED IN: Scopus WOS CrossRef: 3
IN MY: ORCID
6
TITLE: Scheduling with sequence-dependent batch setup times: Planning tests for a pharmaceutic industry
AUTHORS: Orestes Cerdeira, J ; Figueiredo, RMV ; Pereira, A; Requejo, C ;
PUBLISHED: 2011, SOURCE: International Journal of Mathematical Modelling and Numerical Optimisation, VOLUME: 2, ISSUE: 3
INDEXED IN: Scopus CrossRef
IN MY: ORCID
7
TITLE: Formulations for the Weight-Constrained Minimum Spanning Tree Problem  Full Text
AUTHORS: Cristina Requejo ; Agostinho Agra ; Adelaide Cerveira ; Eulália Santos; Theodore E Simos; George Psihoyios; Ch Tsitouras;
PUBLISHED: 2010, SOURCE: International Conference on Numerical Analysis and Applied Mathematics in NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS I-III, VOLUME: 1281
INDEXED IN: Scopus WOS CrossRef: 4
IN MY: ORCID
8
TITLE: Extended formulations for the cardinality constrained subtree of a tree problem  Full Text
AUTHORS: Agra, A ; Gouveia, L ; Requejo, C ;
PUBLISHED: 2009, SOURCE: OPERATIONS RESEARCH LETTERS, VOLUME: 37, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 1
IN MY: ORCID
9
TITLE: Greedy heuristics for the diameter-constrained minimum spanning tree problem  Full Text
AUTHORS: Requejo, C ; Santos, E;
PUBLISHED: 2009, SOURCE: Journal of Mathematical Sciences, VOLUME: 161, ISSUE: 6
INDEXED IN: Scopus CrossRef: 7
IN MY: ORCID
10
TITLE: The linking set problem: A polynomial special case of the multiple-choice knapsack problem  Full Text
AUTHORS: Agra, A ; Requejo, C ;
PUBLISHED: 2009, SOURCE: Journal of Mathematical Sciences, VOLUME: 161, ISSUE: 6
INDEXED IN: Scopus CrossRef: 4
IN MY: ORCID
Page 1 of 2. Total results: 14.

footer slogan

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service