Pierre Pesneau

Publications

250

Citations

H-Index

2004

Active since

Affiliations

Centre National de la Recherche Scientifique(Current)

Institut de Mathématiques de Bordeaux

Université de Bordeaux

Université Clermont Auvergne

UCLouvain

Pierre Pesneau is an author at Centre National de la Recherche Scientifique specializing in combinatorial optimization, discrete mathematics, and graph theory.

Top concepts

Combinatorial OptimizationDiscrete MathematicsEngineeringGraph TheoryMathematical ProgrammingInteger ProgrammingDiscrete OptimizationComputational ComplexityComputer ScienceNetwork Analysis

Publications per year

2004–2017

Publications

Two Edge-Disjoint Hop-Constrained Paths and Polyhedra

David Huygens, A. Ridha Mahjoub, Pierre Pesneau · SIAM Journal on Discrete Mathematics · 2004 · 43 citations

Mathematical Programming, Branch-and-bound Algorithm, Engineering +17

Natural and extended formulations for the Time-Dependent Traveling Salesman Problem

Maria Teresa Godinho, Pierre Pesneau · Discrete Applied Mathematics · 2011 · 40 citations · Full text

The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut

David Huygens, Martine Labbé, Ali Ridha Mahjoub et al. · Networks · 2006 · 35 citations

Mathematical Programming, Branch-and-bound Algorithm, Engineering +24

On extended formulations for the precedence constrained asymmetric traveling salesman problem

Luı́s Gouveia, Pierre Pesneau · Networks · 2006 · 35 citations · Full text

Mathematical Programming, Branch-and-bound Algorithm, New Inequalities +19

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut

Bernard Fortz, A. Ridha Mahjoub, S. Thomas McCormick et al. · Mathematical Programming · 2005 · 31 citations · Full text

Geometric Graph Theory, Graph Theory, Bounded Rings +7

Rows per page

1–5 of 9