| Two edge-disjoint hop-constrained paths and polyhedra D Huygens, AR Mahjoub, P Pesneau SIAM Journal on Discrete Mathematics 18 (2), 287-312, 2004 | 57 | 2004 |
| Natural and extended formulations for the time-dependent traveling salesman problem MT Godinho, L Gouveia, P Pesneau Discrete Applied Mathematics 164, 138-153, 2014 | 56 | 2014 |
| The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut D Huygens, M Labbé, AR Mahjoub, P Pesneau Networks: An International Journal 49 (1), 116-133, 2007 | 53 | 2007 |
| On extended formulations for the precedence constrained asymmetric traveling salesman problem L Gouveia, P Pesneau Networks: An International Journal 48 (2), 77-89, 2006 | 53 | 2006 |
| On the k edge-disjoint 2-hop-constrained paths polytope G Dahl, D Huygens, AR Mahjoub, P Pesneau Operations research letters 34 (5), 577-582, 2006 | 34 | 2006 |
| Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut B Fortz, AR Mahjoub, ST McCormick, P Pesneau Mathematical Programming 105 (1), 85-111, 2006 | 32 | 2006 |
| On a time-dependent formulation and an updated classification of ATSP formulations MT Godinho, L Gouveia, P Pesneau Progress in combinatorial optimization, 2011 | 21 | 2011 |
| Integer programming formulations for the k‐edge‐connected 3‐hop‐constrained network design problem I Diarrassouba, V Gabrel, AR Mahjoub, L Gouveia, P Pesneau Networks 67 (2), 148-169, 2016 | 16 | 2016 |
| A multi scalable model based on a connexity graph representation L Gély, G Dessagne, P Pesneau, F Vanderbeck Computers in Railways XII, Beijing, China 1, 193-204, 2010 | 12 | 2010 |
| On the Steiner 2-edge connected subgraph polytope AR Mahjoub, P Pesneau RAIRO-Operations Research 42 (3), 259-283, 2008 | 10 | 2008 |
| Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem L Gouveia, P Pesneau, M Ruthmair, D Santos Networks 71 (4), 451-465, 2018 | 9 | 2018 |
| The 2-edge connected subgraph problem with bounded rings B Fortz, AR Mahjoub, ST McCormick, P Pesneau Math. Prog, 2003 | 9 | 2003 |
| Feasibility pump heuristics for column generation approaches P Pesneau, R Sadykov, F Vanderbeck International Symposium on Experimental Algorithms, 332-343, 2012 | 6 | 2012 |
| On time-dependent models for unit demand vehicle routing problems MT Godinho, L Gouveia, TL Magnanti, P Pesneau, J Pires International Network Optimization Conference (INOC), 2007 | 6 | 2007 |
| On facets of stable set polytope of claw-free graphs with maximum stable set size three A Pêcher, P Pesneau, A Wagler Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory …, 2006 | 6 | 2006 |
| Reliable service allocation in clouds with memory and capacity constraints O Beaumont, L Eyraud-Dubois, P Pesneau, P Renaud-Goud European Conference on Parallel Processing, 698-706, 2013 | 5 | 2013 |
| Exact approaches for solving a covering problem with capacitated subtrees F Clautiaux, J Guillot, P Pesneau Computers & Operations Research, Elsevier 105, 85-101, 2019 | 4 | 2019 |
| Circuit and bond polytopes on series–parallel graphs S Borne, P Fouilhoux, R Grappe, M Lacroix, P Pesneau Discrete Optimization 17, 55-68, 2015 | 3 | 2015 |
| On the unit demand vehicle routing problem: flow based inequalities implied by a time dependent formulation MT Godinho, L Gouveia, TL Magnanti, P Pesneau, J Pires | 3 | 2009 |
| Meter installation for monitoring network traffic P Meurdesoif, P Pesneau, F Vanderbeck International network optimization conference (INOC), 2007 | 3 | 2007 |
Luis GouveiaProfessor Catedrático da faculdade de Ciências da Universidade de LisboaVerified email at fc.ul.pt
