Agostinho Miguel Mendes Agra


AuthID: R-000-05M

Confirmed Publications: 21



11
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
12
TITLE: A Branch and Bound Approach for Truss Topology Design Problems with Valid Inequalities  Full Text
AUTHORS: Cerveira, A ; Agra, A ; Bastos, F; Varum, H ;
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 Handle
IN MY: ORCID
13
TITLE: A compact formulation of a mixed-integer set  Full Text
AUTHORS: Agostinho Agra ; Miguel Constantino ;
PUBLISHED: 2010, SOURCE: OPTIMIZATION, VOLUME: 59, ISSUE: 5
INDEXED IN: Scopus WOS CrossRef: 1
IN MY: ORCID
14
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
15
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
16
TITLE: Solving huge size instances of the optimal diversity management problem  Full Text
AUTHORS: Agra, A ; Cardoso, DM ; Cerdeira, JO ; Miranda, M; Rocha, E ;
PUBLISHED: 2009, SOURCE: Journal of Mathematical Sciences, VOLUME: 161, ISSUE: 6
INDEXED IN: Scopus CrossRef: 5
IN MY: ORCID
17
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
18
TITLE: Lifting two-integer knapsack inequalities  Full Text
AUTHORS: Agra, A ; Constantino, MF ;
PUBLISHED: 2007, SOURCE: MATHEMATICAL PROGRAMMING, VOLUME: 109, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef: 10
IN MY: ORCID
19
TITLE: Description of 2-integer continuous knapsack polyhedra  Full Text
AUTHORS: Agra, A ; Constantinob, M ;
PUBLISHED: 2006, SOURCE: DISCRETE OPTIMIZATION, VOLUME: 3, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 10
IN MY: ORCID
20
TITLE: Polyhedral description of the integer single node flow set with constant bounds  Full Text
AUTHORS: Agra, A ; Constantino, MF ;
PUBLISHED: 2006, SOURCE: 8th Aussois Workshop on Combinatorial Optimization in MATHEMATICAL PROGRAMMING, VOLUME: 105, ISSUE: 2-3
INDEXED IN: Scopus WOS CrossRef: 2
IN MY: ORCID
Page 2 of 3. Total results: 21.

A place for researchers and their institutions

Useful Links

Get Help

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