Maria Cristina Saraiva Requejo Agra


AuthID: R-000-ATP

Confirmed Publications: 14



11
TITLE: An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees  Full Text
AUTHORS: Luis Gouveia ; Thomas L Magnanti; Cristina Requejo ;
PUBLISHED: 2006, SOURCE: 1st International Network Optimization Conference in ANNALS OF OPERATIONS RESEARCH, VOLUME: 146, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef: 4
IN MY: ORCID
12
TITLE: A 2-path approach for odd-diameter-constrained minimum spanning xand Steiner trees  Full Text
AUTHORS: Gouveia, L ; Magnanti, TL; Requejo, C ;
PUBLISHED: 2004, SOURCE: NETWORKS, VOLUME: 44, ISSUE: 4
INDEXED IN: Scopus WOS CrossRef: 21
IN MY: ORCID
13
TITLE: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
AUTHORS: Gouveia, L ; Requejo, C ;
PUBLISHED: 2001, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 132, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef Handle
IN MY: ORCID
14
TITLE: A block active set algorithm for large-scale quadratic programming with box constraints  Full Text
AUTHORS: Fernandes, L ; Fischer, A; Judice, J ; Requejo, C ; Soares, J;
PUBLISHED: 1998, SOURCE: Seminar on Applied Mathematical Programming and Modelling (APMOD 95) in ANNALS OF OPERATIONS RESEARCH, VOLUME: 81
INDEXED IN: Scopus WOS
IN MY: ORCID
Page 2 of 2. Total results: 14.

footer slogan

Useful Links

Get Help

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