default search action
Audrey Cerqueus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Hamidreza Rezaei, Simon Thevenin, Audrey Cerqueus:
A Mathematical Model Integrating Line Balancing, Equipment Selection, and Workforce Management. CASE 2024: 1383-1388 - 2023
- [j5]Audrey Cerqueus
, Xavier Delorme
Evaluating the scalability of reconfigurable manufacturing systems at the design phase. Int. J. Prod. Res. 61(23): 8080-8093 (2023) - 2021
- [c5]Sawssen Souiden, Audrey Cerqueus
Simulation Model for a Semi-automated Retail Order Picking System Under Uncertainty. PRO-VE 2021: 759-767 - [c4]Audrey Cerqueus
A Bi-objective Based Measure for the Scalability of Reconfigurable Manufacturing Systems. APMS (2) 2021: 544-552 - 2020
- [c3]Magdalena Paul, Audrey Cerqueus
Reconfigurable Digitalized and Servitized Production Systems: Requirements and Challenges. APMS (2) 2020: 501-508 - [c2]Audrey Cerqueus
Balancing and Configuration Planning of RMS to Minimize Energy Cost. APMS (2) 2020: 518-526
2010 – 2019
- 2019
- [j4]Audrey Cerqueus
A branch-and-bound method for the bi-objective simple line assembly balancing problem. Int. J. Prod. Res. 57(18): 5640-5659 (2019) - [j3]Alban Derrien
Additive, Structural, and Multiplicative Transformations for the Construction of Quasi-Cyclic LDPC Matrices. IEEE Trans. Commun. 67(4): 2647-2659 (2019) - [c1]Xavier Boucher, Audrey Cerqueus
Towards Reconfigurable Digitalized and Servitized Manufacturing Systems: Conceptual Framework. APMS (1) 2019: 214-222 - 2017
- [j2]Audrey Cerqueus
On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem. J. Heuristics 23(5): 285-319 (2017) - 2015
- [b1]Audrey Cerqueus:
Bi-objective branch-and-cut algorithms applied to the binary knapsack problem : surrogate upper bound sets, dynamic branching strategies, generation and exploitation of cover inequalities. (Algorithmes de branch-and-cut bi-objectif appliqués au problème du sac-à-dos en variables binaires / Algorithmes de branch-and-cut bi-objectif appliqués au problème du sac-à-dos en variables binaires : ensembles bornants surrogate, stratégies de branchement dynamiques, génération et exploitation d'inégalités de couverture). University of Nantes, France, 2015 - [j1]Audrey Cerqueus
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems. Eur. J. Oper. Res. 244(2): 417-433 (2015)
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-11-08 20:28 CET 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: