default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMário César San Felice
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Vinicius N. G. Pereira, Mário César San Felice
, Pedro Henrique Del Bianco Hokama, Eduardo Candido Xavier:
On the Restricted Steiner Multi Cycle Problem. Comput. Oper. Res. 169: 106752 (2024)- [i3]Pedro Henrique Del Bianco Hokama, Carla Negri Lintzmayer, Mário César San Felice:
A faster heuristic for the Traveling Salesman Problem with Drone. CoRR abs/2405.18566 (2024) - 2023
- [j7]Arthur Pratti Dadalto, Fábio Luiz Usberti, Mário César San Felice:
Exact approaches for the Minimum Subgraph Diameter Problem. Comput. Oper. Res. 150: 106050 (2023) - 2022
- [j6]Cristina G. Fernandes, Carla Negri Lintzmayer, Mário César San Felice:
Leafy spanning k-forests. J. Comb. Optim. 44(2): 934-946 (2022) - [c5]Luis Henrique Pauleti Mendes, Fábio Luiz Usberti, Mário César San Felice:
An Evolutionary Algorithm Applied to the Bi-Objective Travelling Salesman Problem. MIC 2022: 519-524 - 2020
- [j5]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Group parking permit problems. Discret. Appl. Math. 281: 172-194 (2020)
2010 – 2019
- 2019
- [i2]Pedro Henrique Del Bianco Hokama, Mário César San Felice, Evandro C. Bracht, Fábio Luiz Usberti:
Evolutionary framework for two-stage stochastic resource allocation problems. CoRR abs/1903.01885 (2019) - 2018
- [c4]Vinicius N. G. Pereira, Mário César San Felice, Pedro Henrique Del Bianco Hokama, Eduardo C. Xavier:
The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload Problem. SEA 2018: 26:1-26:13 - 2017
- [j4]Marcio Felix Reis, Mário César San Felice, Orlando Lee, Fábio Luiz Usberti:
A 3-approximation algorithm for the maximum leaf k-forest problem. Electron. Notes Discret. Math. 62: 201-206 (2017) - [j3]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
On Generalizations of the Parking Permit Problem and Network Leasing Problems. Electron. Notes Discret. Math. 62: 225-230 (2017) - [c3]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Connected Facility Leasing Problems. ICTCS/CILC 2017: 162-173 - [c2]Mário César San Felice, Cristina G. Fernandes, Carla Negri Lintzmayer:
The Online Multicommodity Connected Facility Location Problem. WAOA 2017: 118-131 - 2016
- [j2]Mário César San Felice, David P. Williamson, Orlando Lee:
A Randomized O(log n)-Competitive Algorithm for the Online Connected Facility Location Problem. Algorithmica 76(4): 1139-1157 (2016) - [i1]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Facility Leasing with Penalties. CoRR abs/1610.00575 (2016) - 2015
- [j1]Mário César San Felice, Sin-Shuen Cheung, Orlando Lee, David P. Williamson:
The Online Prize-Collecting Facility Location Problem. Electron. Notes Discret. Math. 50: 151-156 (2015) - 2014
- [c1]Mário César San Felice, David P. Williamson, Orlando Lee:
The Online Connected Facility Location Problem. LATIN 2014: 574-585
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-05 21:23 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:
