Pierre Pesneau
Pierre Pesneau
Université de Bordeaux, IMB, Inria Bordeaux Sud-Ouest
Verified email at math.u-bordeaux.fr
TitleCited byYear
Two edge-disjoint hop-constrained paths and polyhedra
D Huygens, AR Mahjoub, P Pesneau
SIAM Journal on Discrete Mathematics 18 (2), 287-312, 2004
512004
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
442007
On extended formulations for the precedence constrained asymmetric traveling salesman problem
L Gouveia, P Pesneau
Networks: An International Journal 48 (2), 77-89, 2006
412006
Natural and extended formulations for the time-dependent traveling salesman problem
MT Godinho, L Gouveia, P Pesneau
Discrete Applied Mathematics 164, 138-153, 2014
382014
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
312006
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
302006
On a time-dependent formulation and an updated classification of ATSP formulations
MT Godinho, L Gouveia, P Pesneau
Progress in combinatorial optimization, 2011
162011
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
92016
On the Steiner 2-edge connected subgraph polytope
AR Mahjoub, P Pesneau
RAIRO-Operations Research 42 (3), 259-283, 2008
92008
The 2-edge connected subgraph problem with bounded rings
B Fortz, AR Mahjoub, ST McCormick, P Pesneau
Math. Prog, 2003
92003
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
62006
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
52010
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
52007
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
42013
Feasibility pump heuristics for column generation approaches
P Pesneau, R Sadykov, F Vanderbeck
International Symposium on Experimental Algorithms, 332-343, 2012
32012
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
32009
Meter installation for monitoring network traffic
P Meurdesoif, P Pesneau, F Vanderbeck
International network optimization conference (INOC), 2007
22007
On facets of stable set polytopes of claw-free graphs with stability number three
A Pêcher, P Pesneau, AK Wagler
Electronic Notes in Discrete Mathematics 28, 185-190, 2007
22007
Conception de réseaux 2-connexes avec contraintes de bornes
P Pesneau
Clermont-Ferrand 2, 2003
22003
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
12018
The system can't perform the operation now. Try again later.
Articles 1–20