default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Briant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j10]Alexandre Le Jean
, Nadia Brauner, Olivier Briant, Mircea Cocan, Bérenger David:
Stability constraints in a 3D knapsack problem with non parallelepipedic items. Comput. Ind. Eng. 189: 109943 (2024)- 2020
- [j9]Olivier Briant, Hadrien Cambazard, Diego Cattaruzza, Nicolas Catusse, Anne-Laure Ladier, Maxime Ogier:
An efficient and general approach for the joint order batching and picker routing problem. Eur. J. Oper. Res. 285(2): 497-512 (2020) - 2018
- [j8]Ana Salmi, David Peidro, Eric Blanco, Olivier Briant, Joshua D. Summers:
A cost estimation model to support automation decision in assembly systems design. Int. J. Prod. Res. 56(24): 7426-7443 (2018) - 2016
- [j7]Julien Guépet, Olivier Briant, Jean-Philippe Gayon, Rodrigo Acuna-Agost:
The aircraft ground routing problem: Analysis of industry punctuality indicators in a sustainable perspective. Eur. J. Oper. Res. 248(3): 827-839 (2016) - 2015
- [j6]Julien Guépet, Rodrigo Acuna-Agost, Olivier Briant, Jean-Philippe Gayon:
Exact and heuristic approaches to the airport stand allocation problem. Eur. J. Oper. Res. 246(2): 597-608 (2015) - 2013
- [j5]Manuel Ruiz, Olivier Briant, Jean-Maurice Clochard, Bernard Penz:
Large-scale standard pooling problems with constrained pools and fixed demands. J. Glob. Optim. 56(3): 939-956 (2013) - 2008
- [j4]Olivier Briant, Denis Naddef, Grégory Mounié:
Greedy approach and multi-criteria simulated annealing for the car sequencing problem. Eur. J. Oper. Res. 191(3): 993-1003 (2008) - [j3]Olivier Briant, Claude Lemaréchal, Philippe Meurdesoif, S. Michel, Nancy Perrot, François Vanderbeck:
Comparison of bundle and classical column generation. Math. Program. 113(2): 299-344 (2008) - 2007
- [j2]Marie Chavent, Yves Lechevallier, Olivier Briant:
DIVCLUS-T: A monothetic divisive hierarchical clustering method. Comput. Stat. Data Anal. 52(2): 687-701 (2007) - 2004
- [j1]Olivier Briant, Denis Naddef:
The Optimal Diversity Management Problem. Oper. Res. 52(4): 515-526 (2004)
Conference and Workshop Papers
- 2017
- [c1]Grigori German, Olivier Briant, Hadrien Cambazard, Vincent Jost:
Arc Consistency via Linear Programming. CP 2017: 114-128
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-25 20:58 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:
