default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenzo Fiaschi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j10]Marco Cococcioni
, Lorenzo Fiaschi:
Linear programming with infinite, finite, and infinitesimal values in the right-hand side. Appl. Math. Comput. 486: 129044 (2025)- 2024
- [j9]Marco Cococcioni, Alessandro Cudazzo, Lorenzo Fiaschi, Massimo Pappalardo, Yaroslav D. Sergeyev:
A new cutting plane method for lexicographic multi-objective integer linear programming. Commun. Nonlinear Sci. Numer. Simul. 129: 107674 (2024) - [i2]Lorenzo Fiaschi, Marco Cococcioni:
Informed deep hierarchical classification: a non-standard analysis inspired approach. CoRR abs/2409.16956 (2024) - 2023
- [j8]Leonardo Lai, Lorenzo Fiaschi, Marco Cococcioni, Kalyanmoy Deb:
Pure and mixed lexicographic-paretian many-objective optimization: state of the art. Nat. Comput. 22(2): 227-242 (2023) - [c4]Lorenzo Fiaschi, Federico Rossi, Marco Cococcioni, Sergio Saponara:
Speeding Up Non-archimedean Numerical Computations Using AVX-512 SIMD Instructions. ApplePies 2023: 62-67 - 2022
- [j7]Vieri Benci, Marco Cococcioni, Lorenzo Fiaschi:
Non-Standard Analysis Revisited: An Easy Axiomatic Presentation Oriented Towards Numerical Applications. Int. J. Appl. Math. Comput. Sci. 32(1): 65-80 (2022) - [c3]Federico Rossi, Lorenzo Fiaschi, Marco Cococcioni, Sergio Saponara:
Design and FPGA Synthesis of BAN Processing Unit for Non-Archimedean Number Crunching. ApplePies 2022: 320-325 - 2021
- [j6]Lorenzo Fiaschi, Marco Cococcioni:
Non-Archimedean game theory: A numerical approach. Appl. Math. Comput. 409: 125356 (2021) - [j5]Marco Cococcioni, Lorenzo Fiaschi, Luca Lambertini:
Non-Archimedean zero-sum games. J. Comput. Appl. Math. 393: 113483 (2021) - [j4]Marco Cococcioni, Lorenzo Fiaschi:
The Big-M method with the numerical infinite M. Optim. Lett. 15(7): 2455-2468 (2021) - [j3]Leonardo Lai, Lorenzo Fiaschi, Marco Cococcioni, Kalyanmoy Deb:
Solving Mixed Pareto-Lexicographic Multiobjective Optimization Problems: The Case of Priority Levels. IEEE Trans. Evol. Comput. 25(5): 971-985 (2021) - [c2]Leonardo Lai, Lorenzo Fiaschi, Marco Cococcioni, Kalyanmoy Deb:
Handling Priority Levels in Mixed Pareto-Lexicographic Many-Objective Optimization Problems. EMO 2021: 362-374 - 2020
- [j2]Leonardo Lai, Lorenzo Fiaschi, Marco Cococcioni:
Solving mixed Pareto-Lexicographic multi-objective optimization problems: The case of priority chains. Swarm Evol. Comput. 55: 100687 (2020)
2010 – 2019
- 2019
- [c1]Lorenzo Fiaschi, Marco Cococcioni:
Generalizing Pure and Impure Iterated Prisoner's Dilemmas to the Case of Infinite and Infinitesimal Quantities. NUMTA (2) 2019: 370-377 - 2018
- [j1]Lorenzo Fiaschi, Marco Cococcioni:
Numerical Asymptotic Results in Game Theory Using Sergeyev's Infinity Computing. Int. J. Unconv. Comput. 14(1): 1-25 (2018) - [i1]Lorenzo Fiaschi, Marco Cococcioni:
Numerical Asymptotic Results in Game Theory Using Sergeyev's Infinity Computing. CoRR abs/1808.00738 (2018)
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-18 20: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:
