21
TITLE: New advances and applications in deterministic and stochastic network optimization
AUTHORS: Luis Gouveia; Pedro Moura;
PUBLISHED: 2018, SOURCE: Networks, VOLUME: 72, ISSUE: 1
INDEXED IN: CrossRef
IN MY: ORCID
22
TITLE: Design of survivable networks with vulnerability constraints
AUTHORS: Gouveia, L; Leitner, M;
PUBLISHED: 2017, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 258, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef: 11
IN MY: ORCID
23
TITLE: Spanning trees with a constraint on the number of leaves. A new formulation
AUTHORS: Gouveia, L; Simonetti, L;
PUBLISHED: 2017, SOURCE: COMPUTERS & OPERATIONS RESEARCH, VOLUME: 81
INDEXED IN: Scopus WOS CrossRef: 5
IN MY: ORCID
24
TITLE: Models for the piecewise linear unsplittable multicommodity flow problems
AUTHORS: Fortz, B; Gouveia, L; Joyce Moniz, M;
PUBLISHED: 2017, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 261, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef: 17
IN MY: ORCID
25
TITLE: New path elimination constraints for multi-depot routing problems
AUTHORS: Bektaş, T; Gouveia, L; Santos, D;
PUBLISHED: 2017, SOURCE: Networks, VOLUME: 70, ISSUE: 3
INDEXED IN: Scopus CrossRef: 10
IN MY: ORCID
26
TITLE: Preface: Static and dynamic optimization models for network routing problems
AUTHORS: Luis Gouveia; Michał Pióro; Jacek Rak;
PUBLISHED: 2017, SOURCE: Networks, VOLUME: 69, ISSUE: 1
INDEXED IN: Scopus CrossRef
IN MY: ORCID
27
TITLE: Reformulations by discretization for piecewise linear integer multicommodity network flow problems
AUTHORS: Bernard Gendron; Luis Gouveia;
PUBLISHED: 2017, SOURCE: Transportation Science, VOLUME: 51, ISSUE: 2
INDEXED IN: Scopus CrossRef: 16
IN MY: ORCID
28
TITLE: Lexicographical minimization of routing hops in hop-constrained node survivable networks  Full Text
AUTHORS: Luis Gouveia; Pedro Patricio; Amaro de Sousa;
PUBLISHED: 2016, SOURCE: International Conference on Networking and Electronic Commerce in TELECOMMUNICATION SYSTEMS, VOLUME: 62, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 3
IN MY: ORCID
29
TITLE: Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem  Full Text
AUTHORS: Diarrassouba, I; Gabrel, V; Mahjoub, AR; Gouveia, L; Pesneau, P;
PUBLISHED: 2016, SOURCE: NETWORKS, VOLUME: 67, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
30
TITLE: Models for a Steiner multi-ring network design problem with revenues  Full Text
AUTHORS: Ana Bautzer; Luis Gouveia; Ana Paias; Jose Manuel Pires;
PUBLISHED: 2016, SOURCE: TOP, VOLUME: 24, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
Page 3 of 8. Total results: 73.