default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaulo Morelato França
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j18]Claudio Fabiano Motta Toledo, Márcio da Silva Arantes, Marcelo Yukio Bressan Hossomi, Paulo Morelato França, Kerem Akartunali
:
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21(5): 687-717 (2015)- 2014
- [j17]Laura Silva de Assis, Paulo Morelato França, Fábio Luiz Usberti:
A redistricting problem applied to meter reading in power distribution networks. Comput. Oper. Res. 41: 65-75 (2014) - [j16]Claudio Fabiano Motta Toledo, Lucas de Oliveira, Rodrigo de Freitas Pereira, Paulo Morelato França, Reinaldo Morabito:
A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem. Comput. Oper. Res. 48: 40-52 (2014) - [j15]Claudio Fabiano Motta Toledo, Leandro Cristante de Oliveira, Paulo Morelato França:
Global optimization using a genetic algorithm with hierarchically structured population. J. Comput. Appl. Math. 261: 341-351 (2014) - 2013
- [j14]Alexander J. Benavides, Marcus Ritt, Luciana S. Buriol, Paulo Morelato França:
An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks. Comput. Oper. Res. 40(1): 24-32 (2013) - [j13]Claudio Fabiano Motta Toledo, Renato Resende Ribeiro de Oliveira, Paulo Morelato França:
A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Comput. Oper. Res. 40(4): 910-919 (2013) - [j12]Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França:
GRASP with evolutionary path-relinking for the capacitated arc routing problem. Comput. Oper. Res. 40(12): 3206-3217 (2013) - [c13]Claudio Fabiano Motta Toledo, Marcelo Yukio Bressan Hossomi, Márcio da Silva Arantes, Paulo Morelato França:
Genetic algorithm, MIP and improvement heuristic applied to the MLCLP with backlogging. IEEE Congress on Evolutionary Computation 2013: 1483-1490 - 2012
- [p2]Claudio Fabiano Motta Toledo, Márcio da Silva Arantes, Paulo Morelato França, Reinaldo Morabito:
A Memetic Framework for Solving the Lot Sizing and Scheduling Problem in Soft Drink Plants. Variants of Evolutionary Algorithms for Real-World Applications 2012: 59-93 - 2011
- [j11]Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França:
The open capacitated arc routing problem. Comput. Oper. Res. 38(11): 1543-1555 (2011) - [j10]Maria Cristina N. Gramani, Paulo Morelato França, Marcos Nereu Arenales:
A linear optimization approach to the combined production planning model. J. Frankl. Inst. 348(7): 1523-1536 (2011) - [c12]Claudio Fabiano Motta Toledo, Renato Resende Ribeiro de Oliveira, Paulo Morelato França:
A hybrid heuristic approach to solve the multi level capacitated lot sizing problem. IEEE Congress on Evolutionary Computation 2011: 1194-1201 - [c11]Claudio Fabiano Motta Toledo, Márcio da Silva Arantes, Paulo Morelato França:
Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem. GECCO 2011: 443-448 - 2010
- [c10]Paulo Morelato França, Fábio Luiz Usberti, André Luiz Morelato França:
The open Capacitated Arc Routing Problem: Complexity and algorithms. AICCSA 2010: 1
2000 – 2009
- 2009
- [c9]Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França:
The Open Capacitated Arc Routing Problem. CTW 2009: 89-92 - 2008
- [j9]Vinícius Jacques Garcia, Paulo Morelato França:
Multiobjective service restoration in electric distribution networks using a local search based heuristic. Eur. J. Oper. Res. 189(3): 694-705 (2008) - [c8]Claudio Fabiano Motta Toledo, Jose Euripedes Ferreira de Jesus Filho, Paulo Morelato França:
Meta-heuristic approaches for a soft drink industry problem. ETFA 2008: 1384-1391 - [c7]Claudio Fabiano Motta Toledo, Paulo Morelato França, Kalianne Almeida Rosa:
Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem. SAC 2008: 1777-1781 - [p1]Deisemara Ferreira, Paulo Morelato França, Alf Kimms, Reinaldo Morabito, Socorro Rangel, Claudio Fabiano Motta Toledo:
Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a comparison study. Metaheuristics for Scheduling in Industrial and Manufacturing Applications 2008: 169-210 - 2007
- [c6]Claudio Fabiano Motta Toledo, Paulo Morelato França, Reinaldo Morabito, Alf Kimms:
Evolutionary Approaches to Solve an Integrated Lot Scheduling Problem in the Soft Drink Industry. HIS 2007: 95-100 - 2006
- [j8]Maria Cristina N. Gramani, Paulo Morelato França:
The combined cutting stock and lot-sizing problem in industrial processes. Eur. J. Oper. Res. 174(1): 509-521 (2006) - [c5]Vinícius Garcia, Paulo Morelato França, Alexandre Mendes, Pablo Moscato:
A parallel memetic algorithm applied to the total tardiness machine scheduling problem. IPDPS 2006 - 2005
- [j7]Regina Berretta, Paulo Morelato França, Vinícius Amaral Armentano:
Metaheuristic Approaches for the Multilevel Resource-Constrained lot-sizing Problem with setup and lead times. Asia Pac. J. Oper. Res. 22(2): 261-286 (2005) - [j6]Paulo Morelato França, Jatinder N. D. Gupta, Alexandre Mendes, Pablo Moscato, Klaas J. Veltink:
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Comput. Ind. Eng. 48(3): 491-506 (2005) - [c4]Alexandre Mendes, Carlos Cotta, Vinícius Garcia, Paulo Morelato França, Pablo Moscato:
Gene Ordering in Microarray Data Using Parallel Memetic Algorithms. ICPP Workshops 2005: 604-611 - 2004
- [j5]Luciana S. Buriol, Paulo Morelato França, Pablo Moscato:
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem. J. Heuristics 10(5): 483-506 (2004) - 2003
- [c3]Carlos Cotta, Alexandre Mendes, Vinícius Garcia, Paulo Morelato França, Pablo Moscato:
Applying Memetic Algorithms to the Analysis of Microarray Data. EvoWorkshops 2003: 22-32 - 2002
- [c2]Alysson M. Costa, Patrícia A. Vargas, Fernando J. Von Zuben, Paulo Morelato França:
Makespan minimization on parallel processors: an immune-based approach. IEEE Congress on Evolutionary Computation 2002: 920-925 - [c1]Alexandre Mendes, Paulo Morelato França, Pablo Moscato, Vinícius Garcia:
Population Studies for the Gate Matrix Layout Problem. IBERAMIA 2002: 319-339 - 2001
- [j4]Paulo Morelato França, Alexandre Mendes, Pablo Moscato:
A memetic algorithm for the total tardiness single machine scheduling problem. Eur. J. Oper. Res. 132(1): 224-242 (2001)
1990 – 1999
- 1997
- [j3]Paulo Morelato França, Vinícius Amaral Armentano, Regina Berretta, Alistair Richard Clark:
A heuristic method for lot-sizing in multi-stage systems. Comput. Oper. Res. 24(9): 861-874 (1997) - 1995
- [j2]Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller:
The m-Traveling Salesman Problem with Minmax Objective. Transp. Sci. 29(3): 267-275 (1995) - 1994
- [j1]Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller:
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Comput. Oper. Res. 21(2): 205-210 (1994)
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 22:56 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:
