Seguir
Pierre Pesneau
Pierre Pesneau
Université de Bordeaux, IMB, Inria Bordeaux Sud-Ouest
Email confirmado em math.u-bordeaux.fr
Título
Citado por
Citado por
Ano
Two edge-disjoint hop-constrained paths and polyhedra
D Huygens, AR Mahjoub, P Pesneau
SIAM Journal on Discrete Mathematics 18 (2), 287-312, 2004
622004
Natural and extended formulations for the time-dependent traveling salesman problem
MT Godinho, L Gouveia, P Pesneau
Discrete Applied Mathematics 164, 138-153, 2014
592014
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
592007
On extended formulations for the precedence constrained asymmetric traveling salesman problem
L Gouveia, P Pesneau
Networks: An International Journal 48 (2), 77-89, 2006
592006
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
392006
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
362006
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
212016
On a time-dependent formulation and an updated classification of ATSP formulations
MT Godinho, L Gouveia, P Pesneau
Progress in combinatorial optimization, 2011
212011
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
212010
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
142018
On the Steiner 2-edge connected subgraph polytope
AR Mahjoub, P Pesneau
RAIRO-Operations Research 42 (3), 259-283, 2008
122008
Feasibility pump heuristics for column generation approaches
P Pesneau, R Sadykov, F Vanderbeck
International Symposium on Experimental Algorithms, 332-343, 2012
102012
On a Time-Dependent Flow-Based Formulation for the Asymmetric Travelling Salesman Problem
MT Godinho, L Gouveia, P Pesneau
102012
The 2-edge connected subgraph problem with bounded rings
B Fortz, AR Mahjoub, ST McCormick, P Pesneau
Math. Prog, 2003
102003
Exact approaches for solving a covering problem with capacitated subtrees
F Clautiaux, J Guillot, P Pesneau
Computers & Operations Research, Elsevier 105, 85-101, 2019
82019
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
62013
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
62007
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
Circuit and bond polytopes on series–parallel graphs
S Borne, P Fouilhoux, R Grappe, M Lacroix, P Pesneau
Discrete Optimization 17, 55-68, 2015
32015
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
O sistema não pode efectuar a operação agora. Tente mais tarde.
Artigos 1–20