default search action
Zacharie Alès
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Zacharie Alès, Valentine Huré
, Amélie Lambert:
New optimization models for optimal classification trees. Comput. Oper. Res. 164: 106515 (2024) - [j13]Zacharie Alès
Correlation Clustering Problem Under Mediation. INFORMS J. Comput. 36(2): 672-689 (2024) - 2023
- [b2]Zacharie Alès:
Contributions à la résolution de problèmes d'optimisation combinatoire difficiles. (Contributions to solving hard combinatorial optimization problems). IPParis, France, 2023 - [j12]Cristian Duran-Mateluna
Robust MILP formulations for the two-stage weighted vertex p-center problem. Comput. Oper. Res. 159: 106334 (2023) - [j11]Cristian Duran-Mateluna
An efficient benders decomposition for the p-median problem. Eur. J. Oper. Res. 308(1): 84-96 (2023) - [j10]Zacharie Alès, Sourour Elloumi:
Minimizing recovery cost of network optimization problems. Networks 81(1): 125-151 (2023) - 2021
- [j9]Rym Regaieg
Multi-objective optimization for VM placement in homogeneous and heterogeneous cloud service provider data centers. Computing 103(6): 1255-1279 (2021) - 2020
- [j8]Zacharie Alès
The K-partitioning problem: Formulations and branch-and-cut. Networks 76(3): 323-349 (2020) - [c4]Marc Etheve
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm. CPAIOR 2020: 176-185 - [i1]Marc Etheve, Zacharie Alès, Côme Bissuel, Olivier Juan, Safia Kedad-Sidhoum:
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm. CoRR abs/2005.10026 (2020)
2010 – 2019
- 2019
- [c3]Bruno Ferreira Rosa, Marcone Jamilson Freitas Souza, Sérgio Ricardo de Souza, Zacharie Alès, Philippe Yves Paul Michelon:
Valid constraints for time-indexed formulations of job scheduling problems with distinct time windows and sequence-dependent setup times. INOC 2019: 43-48 - 2018
- [j7]Zacharie Alès, Thi Sang Nguyen, Michael Poss:
Minimizing the weighted sum of completion times under processing time uncertainty. Electron. Notes Discret. Math. 64: 15-24 (2018) - [j6]Zacharie Alès, Alexandre Pauchet, Arnaud Knippel:
Extraction and Clustering of Two-Dimensional Dialogue Patterns. Int. J. Artif. Intell. Tools 27(2): 1850001:1-1850001:27 (2018) - [c2]Zacharie Alès, Sourour Elloumi
Compact MILP Formulations for the p-Center Problem. ISCO 2018: 14-25 - 2017
- [j5]Bruno Ferreira Rosa, Marcone Jamilson Freitas Souza
Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties. Comput. Oper. Res. 81: 203-215 (2017) - 2016
- [j4]Zacharie Alès, Arnaud Knippel, Alexandre Pauchet:
Polyhedral combinatorics of the K-partitioning problem with representative variables. Discret. Appl. Math. 211: 1-14 (2016) - [j3]Zacharie Alès, Arnaud Knippel:
An extended edge-representative formulation for the K-partitioning problem. Electron. Notes Discret. Math. 52: 333-342 (2016) - 2015
- [j2]Zacharie Alès, Alexandre Pauchet, Arnaud Knippel, Laurent Vercouter, Christian Gout
Extraction de motifs dialogiques bidimensionnels. Rev. d'Intelligence Artif. 29(6): 655-683 (2015) - 2014
- [b1]Zacharie Alès:
Extraction et partitionnement pour la recherche de régularités : application à l'analyse de dialogues. (Extraction and clustering for regularities identification : application to dialogues analysis). INSA de Rouen, France, 2014 - [j1]Ovidiu Serban, Anne Bersoult, Zacharie Alès, Elise Lebertois, Émilie Chanoni, François Rioult, Alexandre Pauchet:
Modélisation de dialogues pour personnage virtuel narrateur. Rev. d'Intelligence Artif. 28(1): 101-130 (2014) - 2013
- [c1]Alexandre Pauchet, François Rioult, Émilie Chanoni, Zacharie Alès, Ovidiu Serban:
Interactive Narration Requires Interaction and Emotion. ICAART (2) 2013: 527-530
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-10-07 21:13 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: