![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Boris Detienne
Person information
- affiliation: University of Bordeaux, France
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Boris Detienne
, Henri Lefebvre
, Enrico Malaguti, Michele Monaci
:
Adjustable robust optimization with objective uncertainty. Eur. J. Oper. Res. 312(1): 373-384 (2024) - 2023
- [j14]Xavier Blanchot
, François Clautiaux
, Boris Detienne
, Aurélien Froger
, Manuel Ruiz:
The Benders by batch algorithm: Design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs. Eur. J. Oper. Res. 309(1): 202-216 (2023) - [j13]François Clautiaux, Boris Detienne
, Henri Lefebvre
:
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty. J. Sched. 26(2): 169-191 (2023) - 2022
- [j12]Rodolphe Griset
, Pascale Bendotti
, Boris Detienne
, Marc Porcheron
, Halil Sen, François Vanderbeck:
Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem. Eur. J. Oper. Res. 298(3): 1067-1083 (2022) - [j11]Ayse N. Arslan
, Boris Detienne
:
Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems. INFORMS J. Comput. 34(2): 857-871 (2022) - 2021
- [j10]François Clautiaux, Boris Detienne
, G. Guillot:
An iterative dynamic programming approach for the temporal knapsack problem. Eur. J. Oper. Res. 293(2): 442-456 (2021)
2010 – 2019
- 2018
- [j9]Wim van Ackooij
, Jérôme De Boeck
, Boris Detienne
, Stefania Pan, Michael Poss
:
Optimizing power generation in the presence of micro-grids. Eur. J. Oper. Res. 271(2): 450-461 (2018) - 2017
- [c4]Abderrazak Daoudi, Boris Detienne
, Rachid El Azouzi
, Imade Benelallam, El-Houssine Bouyakhf:
Robust coverage optimization approach in Wireless Sensor Networks. WINCOM 2017: 1-7 - 2016
- [j8]Boris Detienne
, Ruslan Sadykov
, Shunji Tanaka:
The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation. Eur. J. Oper. Res. 252(3): 750-760 (2016) - 2014
- [j7]Boris Detienne
:
A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints. Eur. J. Oper. Res. 235(3): 540-552 (2014) - 2013
- [j6]Nabil Absi
, Boris Detienne
, Stéphane Dauzère-Pérès
:
Heuristics for the multi-item capacitated lot-sizing problem with lost sales. Comput. Oper. Res. 40(1): 264-272 (2013) - 2012
- [j5]Boris Detienne
, Stéphane Dauzère-Pérès
, Claude Yugma:
An exact approach for scheduling jobs with regular step cost functions on a single machine. Comput. Oper. Res. 39(5): 1033-1043 (2012) - 2011
- [j4]Boris Detienne
, Stéphane Dauzère-Pérès
, Claude Yugma:
Scheduling jobs on parallel machines to minimize a regular step total cost function. J. Sched. 14(6): 523-538 (2011) - [j3]Boris Detienne
, Stéphane Dauzère-Pérès
, Claude Yugma:
Erratum to: Scheduling jobs on parallel machines to minimize a regular step total cost function. J. Sched. 14(6): 539-540 (2011) - [c3]Nathalie Camelin, Boris Detienne, Stéphane Huet, Dominique Quadri, Fabrice Lefèvre:
Unsupervised Concept Annotation using Latent Dirichlet Allocation and Segmental Methods. ULNLP@EMNLP 2011: 72-81 - [c2]Nathalie Camelin, Boris Detienne, Stéphane Huet, Dominique Quadri, Fabrice Lefèvre:
Concept Discovery for Language Understanding in an Information-query Dialogue System. KDIR 2011: 24-29 - [c1]Nathalie Camelin
, Boris Detienne
, Stéphane Huet, Dominique Quadri, Fabrice Lefèvre:
Concept Discovery and Automatic Semantic Annotation for Language Understanding in an Information-Query Dialogue System Using Latent Dirichlet Allocation and Segmental Methods. IC3K 2011: 45-59 - 2010
- [j2]Boris Detienne
, Eric Pinson, David Rivreau:
Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates. Eur. J. Oper. Res. 201(1): 45-54 (2010)
2000 – 2009
- 2009
- [j1]Boris Detienne
, Laurent Péridy, Eric Pinson, David Rivreau:
Cut generation for an employee timetabling problem. Eur. J. Oper. Res. 197(3): 1178-1184 (2009)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-25 05:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint