1
TITLE: The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms
AUTHORS: Barbato, Michele; Gouveia, Luis;
PUBLISHED: 2024, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 316, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
2
TITLE: The travelling salesman problem with positional consistency constraints: An application to healthcare services  Full Text
AUTHORS: Gouveia, Luis; Paias, Ana; Ponte, Mafalda;
PUBLISHED: 2023, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 308, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 3
IN MY: ORCID
3
TITLE: Node based compact formulations for the Hamiltonian p-median problem
AUTHORS: Barbato, Michele; Canas, Francisco; Gouveia, Luis; Pesneau, Pierre;
PUBLISHED: 2023, SOURCE: NETWORKS, VOLUME: 82, ISSUE: 4
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
4
TITLE: The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods  Full Text
AUTHORS: Bernardino, Raquel; Gouveia, Luis; Paias, Ana; Santos, Daniel;
PUBLISHED: 2022, SOURCE: NETWORKS, VOLUME: 80, ISSUE: 4
INDEXED IN: Scopus WOS CrossRef: 6
IN MY: ORCID
5
TITLE: Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm
AUTHORS: Gouveia, Luis; Leitner, Markus; Ruthmair, Mario;
PUBLISHED: 2022, SOURCE: TRANSPORTATION SCIENCE, VOLUME: 57, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 4
IN MY: ORCID
6
TITLE: A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints
AUTHORS: Fortz, B; Gouveia, L; Moura, P;
PUBLISHED: 2021, SOURCE: NETWORKS, VOLUME: 80, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 1
IN MY: ORCID
7
TITLE: Preface: Special issue on network analytics and optimization
AUTHORS: Bernard Fortz; Luis Gouveia; Christina Büsing; Markus Leitner;
PUBLISHED: 2021, SOURCE: Networks, VOLUME: 77, ISSUE: 4
INDEXED IN: CrossRef
IN MY: ORCID
8
TITLE: Question & Answering Interface to Improve the Students' Experience in an E-learning Course with a Virtual Tutor
AUTHORS: Balsa, J; Neves, L; Carmo, MB; Claudio, AP;
PUBLISHED: 2020, SOURCE: 3rd European-Alliance-for-Innovation (EAI) International Conference on Technology, Innovation, Entrepreneurship and Education (TIE) in TECHNOLOGY, INNOVATION, ENTREPRENEURSHIP AND EDUCATION, VOLUME: 307
INDEXED IN: Scopus WOS CrossRef
9
TITLE: Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem (vol 262, pg 908, 2017)
AUTHORS: Gouveia, L; Leitner, M; Ruthmair, M; Sadykov, R;
PUBLISHED: 2020, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 285, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 19
IN MY: ORCID
10
TITLE: A polyhedral study of the diameter constrained minimum spanning tree problem  Full Text
AUTHORS: Luis Gouveia; Markus Leitner; Ivana Ljubic;
PUBLISHED: 2020, SOURCE: DISCRETE APPLIED MATHEMATICS, VOLUME: 285
INDEXED IN: Scopus WOS
Page 1 of 8. Total results: 73.