default search action
Sylvain Perron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
- [j12]Fernando Kentaro Inaba, Evandro Ottoni Teatini Salles
, Sylvain Perron, Gilles Caporossi:
DGR-ELM-Distributed Generalized Regularized ELM for classification. Neurocomputing 275: 1522-1530 (2018) - 2015
- [j11]Pierre de la Poix de Fréminville, Guy Desaulniers
A column generation heuristic for districting the price of a financial product. J. Oper. Res. Soc. 66(6): 965-978 (2015) - [j10]Martin Cousineau
RWA problem with geodesics in realistic OTN topologies. Opt. Switch. Netw. 15: 18-28 (2015) - 2014
- [j9]Behnaz Saboonchi, Pierre Hansen, Sylvain Perron:
MaxMinMin p-dispersion problem: A variable neighborhood search approach. Comput. Oper. Res. 52: 251-259 (2014) - 2011
- [j8]Charles Audet, Anthony Guillou, Pierre Hansen, Frédéric Messine, Sylvain Perron:
The small hexagon and heptagon with maximum sum of distances between vertices. J. Glob. Optim. 49(3): 467-480 (2011) - [j7]Charles Audet, Pierre Hansen, Sylvain Perron:
Remarks on solutions to a nonconvex quadratic programming test problem. J. Glob. Optim. 50(2): 363-369 (2011) - 2010
- [j6]Sylvain Perron, Pierre Hansen, Sébastien Le Digabel
Exact and heuristic solutions of the global supply chain problem with transfer pricing. Eur. J. Oper. Res. 202(3): 864-879 (2010) - 2008
- [j5]Pierre Hansen, Sylvain Perron:
Merging the local and global approaches to probabilistic satisfiability. Int. J. Approx. Reason. 47(2): 125-140 (2008) - [j4]Charles Audet, Pierre Hansen, Alejandro Karam, Chi To Ng
Exact L 2-norm plane separation. Optim. Lett. 2(4): 483-495 (2008) - 2007
- [j3]Pierre Hansen, Sylvain Perron:
Algorithms for l1-Embeddability and Related Problems. J. Classif. 24(2): 251-275 (2007) - 2004
- [j2]Charles Audet, Pierre Hansen, Frédéric Messine, Sylvain Perron:
The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal. J. Comb. Theory A 108(1): 63-75 (2004) - 2000
- [j1]Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, Sylvain Perron:
Probabilistic satisfiability with imprecise probabilities. Int. J. Approx. Reason. 24(2-3): 171-189 (2000)
Conference and Workshop Papers
- 2017
- [c3]Philippe Gagnon, Gilles Caporossi, Sylvain Perron:
Parallel Community Detection Methods for Sparse Complex Networks. COMPLEX NETWORKS 2017: 290-301 - 2012
- [c2]Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz:
Modularity maximization in networks by variable neighborhood search. Graph Partitioning and Graph Clustering 2012: 113-128 - 1999
- [c1]Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, Sylvain Perron:
Probabilistic Satisfiability with Imprecise Probabilities. ISIPTA 1999: 165-174
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-06-10 20:31 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: