1
TITLE: Node based compact formulations for the Hamiltonian p-median problem  Full Text
AUTHORS: Barbato, Michele; Canas, Francisco; Gouveia, Luis; Pesneau, Pierre;
PUBLISHED: 2023, SOURCE: NETWORKS
INDEXED IN: Scopus WOS
2
TITLE: Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem  Full Text
AUTHORS: Luis Gouveia; Pierre Pesneau; Mario Ruthmair; Daniel Santos;
PUBLISHED: 2018, SOURCE: 4th International Symposium on Combinatorial Optimization (ISCO) in NETWORKS, VOLUME: 71, ISSUE: 4
INDEXED IN: WOS
3
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
4
TITLE: Natural and extended formulations for the Time-Dependent Traveling Salesman Problem  Full Text
AUTHORS: Maria Teresa Godinho; Luis Gouveia; Pierre Pesneau;
PUBLISHED: 2014, SOURCE: 1st International Symposium on Combinatorial Optimization (ISCO) in DISCRETE APPLIED MATHEMATICS, VOLUME: 164
INDEXED IN: WOS
5
TITLE: Hop-indexed circuit-based formulations for the traveling salesman problem  Full Text
AUTHORS: Godinho, MT ; Gouveia, L ; Pesneau, P;
PUBLISHED: 2010, SOURCE: Electronic Notes in Discrete Mathematics, VOLUME: 36, ISSUE: C
INDEXED IN: Scopus CrossRef
6
TITLE: On extended formulations for the precedence constrained asymmetric traveling salesman problem  Full Text
AUTHORS: Gouveia, L ; Pesneau, P;
PUBLISHED: 2006, SOURCE: NETWORKS, VOLUME: 48, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef