default search action
Luidi Simonetti
Person information
- affiliation: Fluminense Federal University, Institute of Computation, Niterói, RJ, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Gabriel Souto, Masayoshi Aritsugi, Israel Mendonça, Luidi Simonetti, Pedro Henrique González:
A Q-Learning Hybrid BRKGA Applied to the Knapsack Problem with Forfeits. CEC 2024: 1-8 - 2022
- [j33]Dilson Lucas Pereira
, Abilio Lucena
Exact Solution Algorithms for the Chordless Cycle Problem. INFORMS J. Comput. 34(4): 1970-1986 (2022) - 2021
- [j32]Carlos E. Marciano
Optimizing concurrency under Scheduling by Edge Reversal. Networks 77(4): 520-537 (2021) - [j31]Sávio S. Dias, Luidi Gelabert Simonetti, Luiz Satoru Ochi:
An ils-based heuristic applied to the car renter salesman problem. RAIRO Oper. Res. 55(Supplement): S1725-S1746 (2021) - [j30]Glaubos Clímaco
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem. RAIRO Oper. Res. 55(Supplement): S719-S726 (2021) - 2020
- [j29]Pedro Henrique González Silva, Ana Flávia Uzeda dos Santos Macambira, Renan Vicente Pinto, Luidi Simonetti
New proposals for modelling and solving the problem of covering solids using spheres of different radii. RAIRO Oper. Res. 54(3): 873-882 (2020)
2010 – 2019
- 2019
- [j28]Ana Flávia Uzeda dos Santos Macambira
A new formulation for the Safe Set problem on graphs. Comput. Oper. Res. 111: 346-356 (2019) - [j27]Pedro Henrique González
New approaches for the traffic counting location problem. Expert Syst. Appl. 132: 189-198 (2019) - [j26]Marcos A. Guerine, Murilo B. Stockinger, Isabel Rosseti
A provenance-based heuristic for preserving results confidentiality in cloud-based scientific workflows. Future Gener. Comput. Syst. 97: 697-713 (2019) - [j25]Glaubos Clímaco, Isabel Rosseti
Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem. Int. Trans. Oper. Res. 26(2): 615-641 (2019) - [j24]Ali Ridha Mahjoub, Michael Poss
Distance Transformation for Network Design Problems. SIAM J. Optim. 29(2): 1687-1713 (2019) - [c11]Glaubos Clímaco, Pedro Henrique González
A Biased Random-Key Genetic Algorithm for the Traffic Counting Location Problem. BRACIS 2019: 275-280 - [c10]Carlos E. Marciano
Minimum Concurrency for Assembling Computer Music. INOC 2019: 83-88 - 2018
- [c9]Edcarllos Santos, Puca Huachi Vaz Penna, Igor Machado Coelho, Heder Dorneles Soares, Luiz Satoru Ochi, Luidi Simonetti
Logistics SLA optimization service for transportation in smart cities. IJCNN 2018: 1-8 - 2017
- [j23]Luis Gouveia
Spanning trees with a constraint on the number of leaves. A new formulation. Comput. Oper. Res. 81: 257-268 (2017) - 2016
- [j22]Jesus Ossian Cunha, Luidi Simonetti
Lagrangian heuristics for the Quadratic Knapsack Problem. Comput. Optim. Appl. 63(1): 97-120 (2016) - [j21]Pedro Henrique González
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow. Comput. Oper. Res. 76: 134-146 (2016) - [j20]Edcarllos Santos, Luiz Satoru Ochi
A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem. Electron. Notes Discret. Math. 52: 197-204 (2016) - [j19]Alexandre Salles da Cunha, Luidi Simonetti
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 52: 237-244 (2016) - [j18]Abilio Lucena
The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm. Electron. Notes Discret. Math. 52: 285-292 (2016) - [j17]Rian G. S. Pinheiro
On solving manufacturing cell formation via Bicluster Editing. Eur. J. Oper. Res. 254(3): 769-779 (2016) - 2015
- [j16]Alexandre Salles da Cunha, Luidi Simonetti
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem. Eur. J. Oper. Res. 246(2): 392-399 (2015) - [j15]Alexandre Salles da Cunha, Luidi Simonetti
Formulations and exact solution approaches for the degree preserving spanning tree problem. Networks 65(4): 329-343 (2015) - [i2]Pedro Henrique González, Luidi Simonetti, Philippe Michelon, Carlos Alberto de Jesus Martinhon, Edcarllos Santos:
A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow. CoRR abs/1504.03217 (2015) - 2014
- [j14]Agostinho Agra
Hybrid heuristics for a short sea inventory routing problem. Eur. J. Oper. Res. 236(3): 924-935 (2014) - [j13]Bernard Gendron, Abilio Lucena
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. INFORMS J. Comput. 26(4): 645-657 (2014) - [j12]Breno Piva
Integer programming approaches for minimum stabbing problems. RAIRO Oper. Res. 48(2): 211-233 (2014) - [c8]Pedro Henrique González, Luidi Gelabert Simonetti
A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow. ICEIS (1) 2014: 384-394 - [c7]Pedro Henrique González, Luidi Gelabert Simonetti
An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow. ICORES 2014: 100-107 - [c6]Pedro Henrique González
A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow. ICORES (Selected Papers) 2014: 173-185 - 2013
- [j11]Bernard Gendron, Abilio Lucena
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. Electron. Notes Discret. Math. 41: 173-180 (2013) - [j10]Abilio Lucena
Formulating and Solving the Minimum Dominating Cycle Problem. Electron. Notes Discret. Math. 41: 423-430 (2013) - [j9]Abilio Lucena
A New Formulation and Computational Results for the Simple Cycle Problem. Electron. Notes Discret. Math. 44: 83-88 (2013) - [j8]Luidi Simonetti
Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem. Math. Program. 142(1-2): 511-538 (2013) - [j7]Ali Ridha Mahjoub, Luidi Simonetti
Hop-level flow formulation for the survivable network design with hop constraints problem. Networks 61(2): 171-179 (2013) - [i1]Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz S. Ochi, Luidi Simonetti, Anand Subramanian:
On Solving Manufacturing Cell Formation via Bicluster Editing. CoRR abs/1312.3288 (2013) - 2012
- [c5]Ana Cristina Bicharra Garcia
An Intelligent Design Model for Offshore Petroleum Production Elements Layout. IBERAMIA 2012: 702-711 - 2011
- [j6]Luidi Simonetti
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm. Discret. Appl. Math. 159(16): 1901-1914 (2011) - [j5]Luidi Simonetti
New branch-and-bound algorithms for k-cardinality tree problems. Electron. Notes Discret. Math. 37: 27-32 (2011) - [j4]Luis Eduardo Neves Gouveia
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Math. Program. 128(1-2): 123-148 (2011) - [c4]Alexandre Salles da Cunha, Luidi Simonetti
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem. INOC 2011: 43-50 - [c3]Luidi Simonetti
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm. INOC 2011: 162-169 - [c2]Ali Ridha Mahjoub, Luidi Simonetti
Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem. INOC 2011: 176-181 - 2010
- [j3]Abilio Lucena
Reformulations and solution algorithms for the maximum leaf spanning tree problem. Comput. Manag. Sci. 7(3): 289-311 (2010)
2000 – 2009
- 2009
- [j2]Luidi Simonetti
Upper and lower bounding procedures for the minimum caterpillar spanning problem. Electron. Notes Discret. Math. 35: 83-88 (2009) - [c1]Luidi Simonetti, Yuri Frota, Cid C. de Souza:
An Exact Method for the Minimum Caterpillar Spanning Problem. CTW 2009: 48-51 - 2008
- [j1]Marcia Helena Costa Fampa
Bilevel optimization applied to strategic pricing in competitive electricity markets. Comput. Optim. Appl. 39(2): 121-142 (2008)
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-08-21 21:32 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: