Pierre Pesneau

发表

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

Ali Ridha Mahjoub, S. Thomas McCormick, Bernard Fortz, 2006, Math. Program..

On Steiner 2-edge connected polytopes

Ali Ridha Mahjoub, Pierre Pesneau, 2000, Electron. Notes Discret. Math..

A multi scalable model based on a connexity graph representation

François Vanderbeck, Pierre Pesneau, Laurent Gely, 2010 .

Two Edge-Disjoint Hop-Constrained Paths and Polyhedra

Ali Ridha Mahjoub, David Huygens, Pierre Pesneau, 2005, SIAM J. Discret. Math..

Feasibility Pump Heuristics for Column Generation Approaches

Ruslan Sadykov, Pierre Pesneau, François Vanderbeck, 2012, SEA.

On a Time-Dependent Formulation and an Updated Classification of ATSP Formulations

Maria Teresa Godinho, Pierre Pesneau, Luis Gouveia, 2011 .

Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut

Ali Ridha Mahjoub, Martine Labbé, David Huygens, 2005 .

On facets of stable set polytopes of claw-free graphs with stability number three

Annegret Wagler, Arnaud Pêcher, Pierre Pesneau, 2007, Electron. Notes Discret. Math..

Hop-indexed Circuit-based formulations for the Traveling Salesman Problem

Luís Gouveia, Maria Teresa Godinho, Pierre Pesneau, 2010, Electron. Notes Discret. Math..

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem

Ali Ridha Mahjoub, Luís Gouveia, Virginie Gabrel, 2016, Networks.

On the k edge-disjoint 2-hop-constrained paths polytope

Geir Dahl, David Huygens, Pierre Pesneau, 2006, Oper. Res. Lett..

Mathematical programming formulations for the orthogonal 2d knapsack problem

Arnaud Pêcher, Pierre Pesneau, François Vanderbeck, 2008 .

Reliable Service Allocation in Clouds with Memory and Capacity Constraints

Paul Renaud-Goud, Olivier Beaumont, Lionel Eyraud-Dubois, 2013, Euro-Par Workshops.

Circuit and bond polytopes on series-parallel graphs

Roland Grappe, Mathieu Lacroix, Pierre Fouilhoux, 2015, Discret. Optim..

Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem

Luís Gouveia, Mario Ruthmair, Pierre Pesneau, 2018, Networks.

Column Generation Stabilization using Dual Smoothing: Theory & Practice

Pierre Pesneau, François Vanderbeck, Eduardo Uchoa, 2012 .

On a Time-Dependent Model for the Unit Demand Vehicle Routing Problem

Jose Manuel Pires, Thomas L. Magnanti, Maria Teresa Godinho, 2007 .

Meter installation for monitoring network traffic

Pierre Pesneau, Philippe Meurdesoif, François Vanderbeck, 2007 .

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

Luís Gouveia, Maria Teresa Godinho, Pierre Pesneau, 2014, Discret. Appl. Math..

Aggregation technique applied to a clustering problem for waste collection.

François Clautiaux, Pierre Pesneau, Jeremy Guillot, 2016 .

Aggregation technique applied to a clustering problem

François Clautiaux, Pierre Pesneau, Jeremy Guillot, 2016 .

On the Steiner 2-edge connected subgraph polytope

Ali Rhida Mahjoub, Pierre Pesneau, A. Mahjoub, 2008, RAIRO Oper. Res..

On extended formulations for the precedence constrained asymmetric traveling salesman problem

Luís Gouveia, Pierre Pesneau, L. Gouveia, 2006, Networks.

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

Ali Ridha Mahjoub, Martine Labbé, David Huygens, 2007, Networks.

Exact approaches for solving a covering problem with capacitated subtrees

Jérémy Guillot, François Clautiaux, Pierre Pesneau, 2019, Comput. Oper. Res..

New Results - Network Design and Routing

François Vanderbeck, Pierre Pesneau, Sophie Michel, 2007 .

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

Martine Labbé, David Huygens, Pierre Pesneau, 2007 .

On the unit demand vehicle routing problem: flow based inequalities implied by a time dependent formulation

Jose Manuel Pires, Thomas L. Magnanti, Maria Teresa Godinho, 2009 .