default search action
Rafael A. Melo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Vitor A. A. Souza
, Rafael A. Melo
The Vehicle Routing Problem with Cross-Docking and Scheduling at the Docking Station: Compact formulation and a General Variable Neighborhood Search metaheuristic. Appl. Soft Comput. 161: 111744 (2024) - [j22]Mateus C. Silva
Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be? Comput. Oper. Res. 168: 106703 (2024) - 2023
- [j21]Rafael A. Melo, Celso C. Ribeiro:
MIP formulations for induced graph optimization problems: a tutorial. Int. Trans. Oper. Res. 30(6): 3159-3200 (2023) - 2022
- [j20]Jesus O. Cunha
A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure. Comput. Ind. Eng. 173: 108698 (2022) - [j19]Ruslán G. Marzo
New formulations and branch-and-cut procedures for the longest induced path problem. Comput. Oper. Res. 139: 105627 (2022) - [j18]Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux:
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study. Inf. Sci. 612: 655-674 (2022) - [j17]Rafael A. Melo, Celso C. Ribeiro
Maximum weighted induced forests and trees: new formulations and a computational comparative review. Int. Trans. Oper. Res. 29(4): 2263-2287 (2022) - 2021
- [j16]Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection. Comput. Oper. Res. 130: 105234 (2021) - [j15]Willian C. S. Martinho, Rafael A. Melo
An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization. Comput. Oper. Res. 135: 105429 (2021) - [j14]Rafael A. Melo
Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem. Eur. J. Oper. Res. 289(1): 75-92 (2021) - [j13]Rafael A. Melo
A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic. Eur. J. Oper. Res. 295(1): 66-81 (2021) - [j12]Jesus O. Cunha
Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure. Eur. J. Oper. Res. 295(3): 874-892 (2021) - [j11]Jesus O. Cunha
On the computational complexity of uncapacitated multi-plant lot-sizing problems. Optim. Lett. 15(2): 803-812 (2021) - [i9]Rafael A. Melo, Celso C. Ribeiro:
Maximum weighted induced forests and trees: New formulations and a computational comparative review. CoRR abs/2102.09194 (2021) - [i8]Rafael A. Melo, Michell F. Queiroz, Marcio Costa Santos:
A matheuristic approach for the $b$-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic. CoRR abs/2102.09696 (2021) - [i7]Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio Costa Santos:
New formulations and branch-and-cut procedures for the longest induced path problem. CoRR abs/2104.09227 (2021) - 2020
- [i6]Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo, Marcio Costa Santos:
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection. CoRR abs/2002.09916 (2020) - [i5]Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo:
On the computational complexity of uncapacitated multi-plant lot-sizing problems. CoRR abs/2003.04438 (2020) - [i4]Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo:
A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics. CoRR abs/2004.04188 (2020) - [i3]Willian C. S. Martinho, Rafael A. Melo, Kenneth Sörensen:
An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization. CoRR abs/2009.01197 (2020) - [i2]Jesus O. Cunha, Rafael A. Melo:
New approaches for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure. CoRR abs/2010.01306 (2020)
2010 – 2019
- 2019
- [j10]Jesus O. Cunha
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing. Comput. Oper. Res. 104: 149-158 (2019) - 2017
- [j9]Rafael A. Melo
Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds. Int. J. Prod. Res. 55(2): 576-592 (2017) - 2016
- [j8]Jesus O. Cunha
On reformulations for the one-warehouse multi-retailer problem. Ann. Oper. Res. 238(1-2): 99-122 (2016) - [j7]Jesus O. Cunha
A computational comparison of formulations for the economic lot-sizing with remanufacturing. Comput. Ind. Eng. 92: 72-81 (2016) - [j6]Rafael A. Melo
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. Comput. Optim. Appl. 65(3): 821-844 (2016) - 2015
- [j5]Rafael A. Melo
Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking. Comput. Ind. Eng. 85: 402-413 (2015) - [i1]Rafael A. Melo, Phillippe Samer, Sebastián Urrutia:
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. CoRR abs/1509.06562 (2015) - 2012
- [j4]Rafael A. Melo
MIP formulations and heuristics for two-level production-transportation problems. Comput. Oper. Res. 39(11): 2776-2786 (2012) - 2010
- [j3]Rafael A. Melo
Optimizing production and transportation in a commit-to-delivery business mode. Eur. J. Oper. Res. 203(3): 614-618 (2010) - [j2]Rafael A. Melo
Uncapacitated two-level lot-sizing. Oper. Res. Lett. 38(4): 241-245 (2010)
2000 – 2009
- 2009
- [j1]Rafael A. Melo
The traveling tournament problem with predefined venues. J. Sched. 12(6): 607-622 (2009) - 2007
- [c1]Sebastián Urrutia
A New Lower Bound to the Traveling Tournament Problem. CISched 2007: 15-18
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-10-07 21:25 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: