default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Renato Sales Amaral
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j22]André Renato Sales Amaral
:
A heuristic approach for the double row layout problem. Ann. Oper. Res. 316(2): 1-36 (2022)- [j21]Gildásio Lecchi Cravo, André Renato Sales Amaral:
Adaptive iterated local search for the parallel row ordering problem. Expert Syst. Appl. 208: 118033 (2022) - 2021
- [j20]Gildásio Lecchi Cravo, Dayan de C. Bissoli, André Renato Sales Amaral:
Otimização por Enxame de Partículas híbrido de duas fases Aplicado o Problema de Layout em Linha Dupla. Inteligencia Artif. 24(67): 51-70 (2021) - [j19]Dayan de C. Bissoli, Nicolas Zufferey, André Renato Sales Amaral:
Lexicographic optimization-based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem. Int. Trans. Oper. Res. 28(5): 2733-2758 (2021) - [j18]André Renato Sales Amaral:
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order. Optim. Lett. 15(4): 1407-1423 (2021) - [c6]Karyne Alves Zampirolli, André Renato Sales Amaral:
Simulated Annealing and Iterated Local Search Approaches to the Aircraft Refueling Problem. ICCSA (4) 2021: 422-438 - 2020
- [j17]Xuhong Yang, Wenming Cheng, Alice E. Smith, André Renato Sales Amaral:
An improved model for the parallel row ordering problem. J. Oper. Res. Soc. 71(3): 475-490 (2020) - [c5]Alexandre Romanelli, André Renato Sales Amaral:
A Solution Approach to The Problem of Nesting Rectangles with Arbitrary Rotations into Containers of Irregular Convex and Non-Convex Shapes. ICCL 2020: 747-762 - [c4]Alba Assis Campos, André Renato Sales Amaral:
An Iterated Local Search for the Multi-objective Dial-a-Ride Problem. ISDA 2020: 1302-1313
2010 – 2019
- 2019
- [j16]Gildásio Lecchi Cravo, André Renato Sales Amaral:
A GRASP algorithm for solving large-scale single row facility layout problems. Comput. Oper. Res. 106: 49-61 (2019) - [j15]André Renato Sales Amaral:
A mixed-integer programming formulation for the double row layout of machines in manufacturing systems. Int. J. Prod. Res. 57(1): 34-47 (2019) - [j14]Leonardo D. Secchin, André Renato Sales Amaral:
An improved mixed-integer programming model for the double row layout of facilities. Optim. Lett. 13(1): 193-199 (2019) - 2018
- [c3]Dayan de C. Bissoli, André Renato Sales Amaral:
A Hybrid Iterated Local Search Metaheuristic for the Flexible job Shop Scheduling Problem. CLEI 2018: 149-157 - [c2]Wagner A. S. Altoé, Dayan de C. Bissoli, Geraldo R. Mauri, André Renato Sales Amaral:
A Clustering Search Metaheuristic for the Bi-objective Flexible Job Shop Scheduling Problem. CLEI 2018: 158-166 - [c1]Dayan de C. Bissoli, Wagner A. S. Altoé, Geraldo R. Mauri, André Renato Sales Amaral:
A simulated annealing metaheuristic for the bi-objective flexible job shop scheduling problem. RICE 2018: 1-6 - 2014
- [j13]Hannu Ahonen, Arlindo Gomes de Alvarenga, André Renato Sales Amaral:
Simulated annealing and tabu search approaches for the Corridor Allocation Problem. Eur. J. Oper. Res. 232(1): 221-233 (2014) - 2013
- [j12]André Renato Sales Amaral:
A parallel ordering problem in facilities layout. Comput. Oper. Res. 40(12): 2930-2939 (2013) - [j11]André Renato Sales Amaral, Adam N. Letchford:
A polyhedral approach to the single row facility layout problem. Math. Program. 141(1-2): 453-477 (2013) - [j10]André Renato Sales Amaral:
Optimal solutions for the double row layout problem. Optim. Lett. 7(2): 407-413 (2013) - 2012
- [j9]André Renato Sales Amaral:
The corridor allocation problem. Comput. Oper. Res. 39(12): 3325-3330 (2012) - 2011
- [j8]Dilip Datta, André Renato Sales Amaral, José Rui Figueira:
Single row facility layout problem using a permutation-based genetic algorithm. Eur. J. Oper. Res. 213(2): 388-394 (2011)
2000 – 2009
- 2009
- [j7]André Renato Sales Amaral:
A new lower bound for the single row facility layout problem. Discret. Appl. Math. 157(1): 183-190 (2009) - [j6]André Renato Sales Amaral:
A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem. Optim. Lett. 3(4): 513-520 (2009) - 2008
- [j5]André Renato Sales Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
A New Lower Bound for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 30: 87-92 (2008) - [j4]André Renato Sales Amaral:
An Exact Approach to the One-Dimensional Facility Layout Problem. Oper. Res. 56(4): 1026-1033 (2008) - 2007
- [j3]Renzo Zamprogno, André Renato Sales Amaral:
An efficient approach for large scale graph partitioning. J. Comb. Optim. 13(4): 289-320 (2007) - 2006
- [j2]André Renato Sales Amaral:
On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173(2): 508-518 (2006) - 2001
- [j1]Adam N. Letchford, André Renato Sales Amaral:
Analysis of upper bounds for the Pallet Loading Problem. Eur. J. Oper. Res. 132(3): 582-593 (2001)
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 23:16 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:
