Journal articles

2023

ref_biblio

Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau. Node based compact formulations for the Hamiltonian p ‐median problem. Networks, In press, 82 (4), pp.336-370. ⟨10.1002/net.22163⟩. ⟨hal-04124268⟩

Accès au texte intégral et bibtex

2019

ref_biblio

François Clautiaux, Jeremy Guillot, Pierre Pesneau. Exact approaches for solving a covering problem with capacitated subtrees. Computers and Operations Research, 2019, 105, pp.85-101. ⟨10.1016/j.cor.2019.01.008⟩. ⟨hal-02053563⟩

Accès au texte intégral et bibtex

2017

ref_biblio

Luís Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos. Combining and projecting flow models for the (Precedence Constrained) Asymmetric Traveling Salesman Problem. Networks, 2017, 71 (4), pp.451-465. ⟨10.1002/net.21765⟩. ⟨hal-01655793⟩

Accès au texte intégral et bibtex

2016

ref_biblio

Ibrahima Diarrassouba, V. Gabrel, A. R. Mahjoub, L. Gouveia, Pierre Pesneau. Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks, 2016, 67 (2), pp. 148-169. ⟨10.1002/net.21667⟩. ⟨hal-01281958⟩

Accès au bibtex

2015

ref_biblio

Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau. Circuit and bond polytopes on series–parallel graphs. Discrete Optimization, 2015, 17, pp.55-68. ⟨10.1016/j.disopt.2015.04.001⟩. ⟨hal-01215899⟩

Accès au texte intégral et bibtex

2014

ref_biblio

Maria Teresa Godinho, Luís Gouveia, Pierre Pesneau. Natural and Extended formulations for the Time-Dependent Traveling Salesman Problem. Discrete Applied Mathematics, 2014, Combinatorial Optimization, 164, pp.138-153. ⟨10.1016/j.dam.2011.11.019⟩. ⟨hal-00648451⟩

Accès au texte intégral et bibtex

2008

ref_biblio

Ali Ridha Mahjoub, Pierre Pesneau. On the Steiner 2-edge connected subgraph polytope. RAIRO - Operations Research, 2008, 42, pp.259-283. ⟨10.1051/ro:2008022⟩. ⟨inria-00325988⟩

Accès au bibtex

2007

ref_biblio

David Huygens, Martine Labbé, Ali Ridha Mahjoub, Pierre Pesneau. The two-edge connected hop-constrained network design problem: valid inequalities and Branch-and-Cut. Networks, 2007, 49 (1), pp.116-133. ⟨10.1002/net.20146⟩. ⟨inria-00281937⟩

Accès au bibtex

2006

ref_biblio

Bernard Fortz, Ali Ridha Mahjoub, S. T. Mccormick, Pierre Pesneau. Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Mathematical Programming, Series A, 2006, 105, pp.85-111. ⟨10.1007/s10107-005-0576-5⟩. ⟨inria-00281574⟩

Accès au bibtex

ref_biblio

Luís Gouveia, Pierre Pesneau. On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks, 2006, 48 (2), pp.77-89. ⟨10.1002/net.20122⟩. ⟨inria-00281586⟩

Accès au texte intégral et bibtex

ref_biblio

Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau. On the k edge-disjoint 2-hop-constrained paths polytope. Operations Research Letters, 2006, 34, pp.577-582. ⟨10.1016/j.orl.2005.09.001⟩. ⟨inria-00281973⟩

Accès au bibtex

2004

ref_biblio

David Huygens, Ali Ridha Mahjoub, Pierre Pesneau. Two edge-disjoint hop-constrained paths and polyhedra. SIAM Journal on Discrete Mathematics, 2004, 18 (2), pp.287-312. ⟨10.1137/S0895480102419445⟩. ⟨inria-00281980⟩

Accès au bibtex

Conference papers

2017

ref_biblio

Luís Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos. Extending and Projecting Flow Models for the (PC)ATSP. Optimization 2017, Sep 2017, Lisbon, Portugal. ⟨hal-01667084⟩

Accès au bibtex

2016

ref_biblio

L. Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos. Network flow precedence based formulations for the asymmetric traveling salesman problem with precedence constraints. 4th International Symposium on Combinatorial Optimization (ISCO 2016), May 2016, Vietri sul Mare, Italy. ⟨hal-01418319⟩

Accès au bibtex

ref_biblio

François Clautiaux, Jeremy Guillot, Pierre Pesneau. Aggregation technique applied to a clustering problem. 4th International Symposium on Combinatorial Optimization (ISCO 2016), May 2016, Vietri sul Mare, Italy. ⟨hal-01418337⟩

Accès au bibtex

ref_biblio

François Clautiaux, Jeremy Guillot, Pierre Pesneau. Aggregation technique applied to a clustering problem for waste collection.. ROADEF 2016, Feb 2016, Compiègne, France. ⟨hal-01418346⟩

Accès au bibtex

2014

ref_biblio

Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau. Circuit and bond polytopes in series-parallel graphs. ISCO 2014 - 3rd International Symposium on Combinatorial Optimization, Mar 2014, Lisbon, Portugal. ⟨hal-01003189⟩

Accès au bibtex

ref_biblio

Maria Teresa Godinho, Luís Gouveia, Thomas L. Magnanti, Pierre Pesneau. On the Single Commodity Flow Formulation: Generalizing the Upper and Lower Flow Bounding Inequalities . 3rd International Symposium on Combinatorial Optimization (ISCO 2014), Mar 2014, Lisbon, Portugal. ⟨hal-01111634⟩

Accès au bibtex

ref_biblio

Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau. Branch-and-Cut algorithm for the connected-cut problem. ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France. ⟨hal-00946285⟩

Accès au bibtex

2013

ref_biblio

Olivier Beaumont, Lionel Eyraud-Dubois, Pierre Pesneau, Paul Renaud-Goud. Reliable Service Allocation in Clouds with Memory and Capacity Constraints. Resilience 2013, in conjunction with EuroPar 2013, Sep 2013, Aachen, Germany. ⟨hal-00850125⟩

Accès au texte intégral et bibtex

ref_biblio

Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau. Circuit and bond polytopes in series-parallel graphs. JPOC8 - 8èmes Journées Polyèdres et Optimisation Combinatoire, Jun 2013, Clermont-Ferrand, France. ⟨hal-00909472⟩

Accès au bibtex

2012

ref_biblio

François Vanderbeck, Jinil Han, Pierre Pesneau, Artur Alves Pessoa, Ruslan Sadykov, et al.. Column Generation Stabilization using Dual Smoothing: Theory and Practice. Informs Annual Meeting: Informatics Rising, Oct 2012, Phoenix, United States. ⟨hal-00750576⟩

Accès au bibtex

ref_biblio

François Vanderbeck, Cedric Joncour, Sophie Michel, Pierre Pesneau, Artur Alves Pessoa, et al.. Primal heuristics for branch-and-price. ISMP 2012 - 21th International Symposium on Mathematical Programming, Aug 2012, Berlin, Germany. ⟨hal-00750578⟩

Accès au bibtex

ref_biblio

Jinil Han, Pierre Pesneau, Artur Alves Pessoa, Eduardo Uchoa, François Vanderbeck. Column Generation Stabilization using Dual Smoothing: Theory & Practice. Column Generation 2012, Jun 2012, Bromont, Canada. ⟨hal-00750573⟩

Accès au bibtex

ref_biblio

Pierre Pesneau, Ruslan Sadykov, François Vanderbeck. Feasibility Pump Heuristics for Column Generation Approaches. 11th International Symposium on Experimental Algorithms, Ralf Klasing, Jun 2012, Bordeaux, France. ⟨hal-00686255⟩

Accès au texte intégral et bibtex

ref_biblio

François Vanderbeck, Jinil Han, Pierre Pesneau, Artur Alves Pessoa, Ruslan Sadykov, et al.. Unifying procedures for Cut-Column Generation and Stabilization. Workshop on Integer Programming, Mar 2012, Valparaiso, Chile. ⟨hal-00750579⟩

Accès au bibtex

2010

ref_biblio

Laurent Gély, Gilles Dessagne, Pierre Pesneau, François Vanderbeck. A multi scalable model based on a connexity graph representation. 12th International Conference on Computer System Design and Operation in the Railways and other Transit Systems, COMPRAIL 2010, Aug 2010, Beijing, China. pp.193-204, ⟨10.2495/CR100191⟩. ⟨inria-00547026⟩

Accès au bibtex

ref_biblio

Maria Teresa Godinho, Luís Gouveia, Pierre Pesneau. Hop-indexed Circuit-based formulations for the Travelling Salesman Problem. ISCO 2010, Mar 2010, Hammamet, Tunisia. pp.1049-1056, ⟨10.1016/j.endm.2010.05.133⟩. ⟨inria-00453242⟩

Accès au bibtex

2009

ref_biblio

Maria Teresa Godinho, Luís Gouveia, Thomas L. Magnanti, Pierre Pesneau, José Pires. On the unit demand vehicle routing problem: flow based inequalities implied by a time dependent formulation. INOC 2009, Apr 2009, Pisa, Italy. ⟨inria-00453488⟩

Accès au bibtex

2008

ref_biblio

Cedric Joncour, Arnaud Pecher, Pierre Pesneau, Francois Vanderbeck. Mathematical programming formulations for the orthogonal 2d knapsack problem. ROADEF, 2008, France. ⟨hal-00307152⟩

Accès au texte intégral et bibtex

2007

ref_biblio

Philippe Meurdesoif, Pierre Pesneau, François Vanderbeck. Meter installation for monitoring network traffic. International Network Optimization Conference (INOC), Apr 2007, Spa, Belgium. ⟨inria-00281945⟩

Accès au bibtex

ref_biblio

Arnaud Pêcher, Pierre Pesneau, A. Wagler. Générer des facettes pour le polytope des stables dans un graphe sans griffes par la programmation entière. FRANCORO V / ROADEF, Feb 2007, Grenoble, France. ⟨inria-00281949⟩

Accès au bibtex

Book sections

2011

ref_biblio

Maria Teresa Godinho, Luís Gouveia, Pierre Pesneau. On a Time-Dependent Formulation and an Updated Classification of ATSP Formulations. Ali Ridha Mahjoub. Progress in Combinatorial Optimization, Wiley, 2011, 9781848212060. ⟨hal-00648457⟩

Accès au texte intégral et bibtex

Reports

2007

ref_biblio

Maria Teresa Godinho, Luís Gouveia, Thomas L. Magnanti, Pierre Pesneau, José Pires. On a Time-Dependent Model for the Unit Demand Vehicle Routing Problem. [Technical Report] 11-2007, 2007. ⟨inria-00281964⟩

Accès au bibtex