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 ;
SOURCE: 1st International Network Optimization Conference in ANNALS OF OPERATIONS RESEARCH, VOLUME: 146, ISSUE: 1, PUBLISHED: 2006
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 ;
SOURCE: NETWORKS, VOLUME: 44, ISSUE: 4, PUBLISHED: 2004
INDEXED IN: Scopus WOS CrossRef: 21
IN MY: ORCID
13
TITLE: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem  Full Text
AUTHORS: Gouveia, L ; Requejo, C ;
SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 132, ISSUE: 3, PUBLISHED: 2001
INDEXED IN: Scopus WOS CrossRef: 35
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;
SOURCE: Seminar on Applied Mathematical Programming and Modelling (APMOD 95) in ANNALS OF OPERATIONS RESEARCH, VOLUME: 81, PUBLISHED: 1998
INDEXED IN: Scopus WOS
IN MY: ORCID
Page 2 of 2. Total results: 14.