default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Pesneau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j15]Michele Barbato, Francisco Canas
, Luís Gouveia, Pierre Pesneau:
Node based compact formulations for the Hamiltonian p-median problem. Networks 82(4): 336-370 (2023)- 2019
- [j14]François Clautiaux, Jérémy Guillot, Pierre Pesneau:
Exact approaches for solving a covering problem with capacitated subtrees. Comput. Oper. Res. 105: 85-101 (2019) - 2018
- [j13]Luis Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos:
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. Networks 71(4): 451-465 (2018) - 2016
- [j12]I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67(2): 148-169 (2016) - 2015
- [j11]Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau:
Circuit and bond polytopes on series-parallel graphs. Discret. Optim. 17: 55-68 (2015) - 2014
- [j10]Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem. Discret. Appl. Math. 164: 138-153 (2014) - 2010
- [j9]Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. Electron. Notes Discret. Math. 36: 1049-1056 (2010) - 2008
- [j8]Ali Ridha Mahjoub, Pierre Pesneau:
On the Steiner 2-edge connected subgraph polytope. RAIRO Oper. Res. 42(3): 259-283 (2008) - 2007
- [j7]Arnaud Pêcher, Pierre Pesneau, Annegret Wagler:
On facets of stable set polytopes of claw-free graphs with stability number three. Electron. Notes Discret. Math. 28: 185-190 (2007) - [j6]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 49(1): 116-133 (2007) - 2006
- [j5]Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau:
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Math. Program. 105(1): 85-111 (2006) - [j4]Luis Eduardo Neves Gouveia, Pierre Pesneau:
On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks 48(2): 77-89 (2006) - [j3]Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau:
On the k edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34(5): 577-582 (2006) - 2004
- [j2]David Huygens, Ali Ridha Mahjoub, Pierre Pesneau:
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra. SIAM J. Discret. Math. 18(2): 287-312 (2004) - 2000
- [j1]Ali Ridha Mahjoub, Pierre Pesneau:
On Steiner 2-edge connected polytopes. Electron. Notes Discret. Math. 5: 210-213 (2000)
Conference and Workshop Papers
- 2013
- [c2]Olivier Beaumont, Lionel Eyraud-Dubois, Pierre Pesneau, Paul Renaud-Goud:
Reliable Service Allocation in Clouds with Memory and Capacity Constraints. Euro-Par Workshops 2013: 698-706 - 2012
- [c1]Pierre Pesneau, Ruslan Sadykov, François Vanderbeck:
Feasibility Pump Heuristics for Column Generation Approaches. SEA 2012: 332-343
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
