default search action
Patrick Soriano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j28]Valérie Bélanger, Ettore Lanzarone
, Vittorio Nicoletta, Angel B. Ruiz
A recursive simulation-optimization framework for the ambulance location and dispatching problem. Eur. J. Oper. Res. 286(2): 713-725 (2020)
2010 – 2019
- 2019
- [j27]Valérie Bélanger, Angel B. Ruiz
Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles. Eur. J. Oper. Res. 272(1): 1-23 (2019) - 2016
- [j26]Valérie Bélanger, Yannick Kergosien
An empirical comparison of relocation strategies in real-time ambulance fleet management. Comput. Ind. Eng. 94: 216-229 (2016) - [j25]José Eduardo Pécora Junior
A hybrid collaborative algorithm to solve an integrated wood transportation and paper pulp production problem. J. Oper. Res. Soc. 67(4): 537-550 (2016) - 2015
- [j24]Roberto Aringhieri
A two level metaheuristic for the operating room scheduling and assignment problem. Comput. Oper. Res. 54: 21-34 (2015) - 2012
- [j23]Valérie Bélanger, Angel B. Ruiz
Déploiement et Redéploiement des Véhicules Ambulanciers dans la Gestion d'un Service Préhospitalier d'Urgence. INFOR Inf. Syst. Oper. Res. 50(1): 1-30 (2012) - 2010
- [j22]Walter Rei, Michel Gendreau, Patrick Soriano:
A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 44(1): 136-146 (2010)
2000 – 2009
- 2009
- [j21]Roxane Kouassi, Michel Gendreau, Jean-Yves Potvin, Patrick Soriano:
Heuristics for multi-period capacity expansion in local telecommunications networks. J. Heuristics 15(4): 381-402 (2009) - [j20]Walter Rei, Jean-François Cordeau, Michel Gendreau, Patrick Soriano:
Accelerating Benders Decomposition by Local Branching. INFORMS J. Comput. 21(2): 333-345 (2009) - 2007
- [j19]José Eduardo Pécora Junior
Minimization of the Wood Density Variation in Pulp and Paper Production. INFOR Inf. Syst. Oper. Res. 45(4): 187-196 (2007) - [j18]Christian Prins, Caroline Prodhon, Angel B. Ruiz
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic. Transp. Sci. 41(4): 470-483 (2007) - 2006
- [j17]Sophie D. Lapierre, Angel B. Ruiz
Balancing assembly lines with tabu search. Eur. J. Oper. Res. 168(3): 826-837 (2006) - [j16]Michel Gendreau, Jean-Yves Potvin, Ali Smires, Patrick Soriano:
Multi-period capacity expansion for a local access telecommunications network. Eur. J. Oper. Res. 172(3): 1051-1066 (2006) - [c2]Michel Gendreau, Jacques A. Ferland, Bernard Gendron, Noureddine Hail, Brigitte Jaumard, Sophie D. Lapierre, Gilles Pesant, Patrick Soriano:
Physician Scheduling in Emergency Rooms. PATAT 2006: 53-66 - 2005
- [j15]Philippe Galinier, Michel Gendreau, Patrick Soriano, Serge Bisaillon:
Solving the frequency assignment problem with polarization by local search and tabu. 4OR 3(1): 59-78 (2005) - 2004
- [j14]Jean-Yves Potvin, Patrick Soriano, Maxime Vallée:
Generating trading rules on the stock markets with genetic programming. Comput. Oper. Res. 31(7): 1033-1047 (2004) - [j13]Sophie D. Lapierre, Angel B. Ruiz
Designing Distribution Networks: Formulations and Solution Heuristic. Transp. Sci. 38(2): 174-187 (2004) - 2003
- [j12]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements. Ann. Oper. Res. 122(1-4): 193-217 (2003) - [j11]Bernard Fortz
A tabu search algorithm for self-healing ring network design. Eur. J. Oper. Res. 151(2): 280-295 (2003) - [j10]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements. Parallel Comput. 29(5): 591-606 (2003) - 2002
- [j9]Gilles Pesant, Patrick Soriano:
An Optimal Strategy for the Constrained Cycle Cover Problem. Ann. Math. Artif. Intell. 34(4): 313-325 (2002) - [j8]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
Diversification strategies in local search for a nonbifurcated network loading problem. Eur. J. Oper. Res. 142(2): 231-241 (2002) - 2001
- [j7]Jacinthe Clossey, Gilbert Laporte, Patrick Soriano:
Solving arc routing problems with turn penalties. J. Oper. Res. Soc. 52(4): 433-439 (2001) - 2000
- [j6]David Berger, Bernard Gendron, Jean-Yves Potvin, S. Raghavan, Patrick Soriano:
Tabu Search for a Network Loading Problem with Multiple Facilities. J. Heuristics 6(2): 253-267 (2000)
1990 – 1999
- 1999
- [j5]Gilles Pesant, Patrick Soriano:
An Optimal Strategy for the Constrained Cycle Cover Problem. Electron. Notes Discret. Math. 1: 48-60 (1999) - 1998
- [j4]Martine Labbé
Covering a graph with cycles. Comput. Oper. Res. 25(6): 499-504 (1998) - 1996
- [j3]Patrick Soriano, Michel Gendreau:
Diversification strategies in tabu search algorithms for the maximum clique problem. Ann. Oper. Res. 63(2): 189-207 (1996) - 1993
- [j2]Teodor Gabriel Crainic
A tabu search procedure for multicommodity location/allocation with balancing requirements. Ann. Oper. Res. 41(4): 359-383 (1993) - [j1]Michel Gendreau, Patrick Soriano, Louis Salvail:
Solving the maximum clique problem using a tabu search approach. Ann. Oper. Res. 41(4): 385-403 (1993) - [c1]Patrick Soriano, Michel Gendreau:
Tabu search algorithms for the maximum clique problem. Cliques, Coloring, and Satisfiability 1993: 221-242
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-04-24 22:50 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: