Остановите войну!
for scientists:
default search action
Luidi Simonetti
- > Home > Persons > Luidi Simonetti
Publications
- 2022
- [j33]Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Exact Solution Algorithms for the Chordless Cycle Problem. INFORMS J. Comput. 34(4): 1970-1986 (2022) - 2021
- [j32]Carlos E. Marciano, Gladstone M. Arantes Jr., Abilio Lucena, Luidi Gelabert Simonetti, Luérbio Faria, Felipe M. G. França:
Optimizing concurrency under Scheduling by Edge Reversal. Networks 77(4): 520-537 (2021) - 2019
- [c10]Carlos E. Marciano, Abilio Lucena, Felipe M. G. França, Luidi Gelabert Simonetti:
Minimum Concurrency for Assembling Computer Music. INOC 2019: 83-88 - 2016
- [j22]Jesus Ossian Cunha, Luidi Simonetti, Abilio Lucena:
Lagrangian heuristics for the Quadratic Knapsack Problem. Comput. Optim. Appl. 63(1): 97-120 (2016) - [j19]Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 52: 237-244 (2016) - [j18]Abilio Lucena, Luidi Simonetti, Alexandre Salles da Cunha:
The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm. Electron. Notes Discret. Math. 52: 285-292 (2016) - 2015
- [j16]Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
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, Abilio Lucena, Bernard Gendron:
Formulations and exact solution approaches for the degree preserving spanning tree problem. Networks 65(4): 329-343 (2015) - 2014
- [j13]Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. INFORMS J. Comput. 26(4): 645-657 (2014) - 2013
- [j11]Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. Electron. Notes Discret. Math. 41: 173-180 (2013) - [j10]Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Formulating and Solving the Minimum Dominating Cycle Problem. Electron. Notes Discret. Math. 41: 423-430 (2013) - [j9]Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
A New Formulation and Computational Results for the Simple Cycle Problem. Electron. Notes Discret. Math. 44: 83-88 (2013) - [j8]Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena:
Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem. Math. Program. 142(1-2): 511-538 (2013) - 2011
- [c4]Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem. INOC 2011: 43-50 - [c3]Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena:
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm. INOC 2011: 162-169 - 2010
- [j3]Abilio Lucena, Nelson Maculan, Luidi Simonetti:
Reformulations and solution algorithms for the maximum leaf spanning tree problem. Comput. Manag. Sci. 7(3): 289-311 (2010)
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 2023-09-27 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint