default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlo Filippi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j25]Carlo Filippi, Gianfranco Guastaroba, Lorenzo Peirano
, M. Grazia Speranza:
Trends in passenger transport optimisation. Int. Trans. Oper. Res. 30(6): 3057-3086 (2023)- 2021
- [j24]Carlo Filippi, Gianfranco Guastaroba, Diana L. Huerta-Muñoz, Maria Grazia Speranza:
A kernel search heuristic for a fair facility location problem. Comput. Oper. Res. 132: 105292 (2021) - [j23]Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni:
A dynamic and probabilistic orienteering problem. Comput. Oper. Res. 136: 105454 (2021) - [j22]Carlo Filippi, Gianfranco Guastaroba, M. Grazia Speranza:
On single-source capacitated facility location with cost and fairness objectives. Eur. J. Oper. Res. 289(3): 959-974 (2021) - 2020
- [j21]Carlo Filippi, Gianfranco Guastaroba, Maria Grazia Speranza:
Conditional value-at-risk beyond finance: a survey. Int. Trans. Oper. Res. 27(3): 1277-1319 (2020)
2010 – 2019
- 2019
- [j20]Carlo Filippi, Wlodzimierz Ogryczak, M. Grazia Speranza:
Bridging k-sum and CVaR optimization in MILP. Comput. Oper. Res. 105: 156-166 (2019) - 2017
- [j19]Carlo Filippi, Renata Mansini, Elisa Stevanato:
Mixed integer linear programming models for optimal crop selection. Comput. Oper. Res. 81: 26-39 (2017) - [j18]Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni:
The probabilistic orienteering problem. Comput. Oper. Res. 81: 269-281 (2017) - 2014
- [j17]Enrico Angelelli, Nicola Bianchessi, Carlo Filippi:
Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51: 268-281 (2014) - 2013
- [j16]Carlo Filippi, Elisa Stevanato:
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits. Comput. Oper. Res. 40(10): 2418-2428 (2013) - [j15]Sofie Coene, Carlo Filippi, Frits C. R. Spieksma, Elisa Stevanato:
Balancing profits and costs on trees. Networks 61(3): 200-211 (2013) - 2012
- [j14]Carlo Filippi, Elisa Stevanato:
A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits. Algorithmic Oper. Res. 7(2) (2012) - 2011
- [j13]Enrico Angelelli, Carlo Filippi:
On the complexity of interval scheduling with a resource constraint. Theor. Comput. Sci. 412(29): 3650-3657 (2011) - 2010
- [j12]Carlo Filippi:
An approximate algorithm for a high-multiplicity parallel machine scheduling problem. Oper. Res. Lett. 38(4): 312-317 (2010)
2000 – 2009
- 2009
- [j11]Carlo Filippi, Giorgio Romanin-Jacur:
Exact and approximate algorithms for high-multiplicity parallel machine scheduling. J. Sched. 12(5): 529-541 (2009) - 2007
- [j10]Carlo Filippi:
On the bin packing problem with a fixed number of object weights. Eur. J. Oper. Res. 181(1): 117-126 (2007) - 2006
- [j9]Alberto Bemporad, Carlo Filippi:
An Algorithm for Approximate Multiparametric Convex Programming. Comput. Optim. Appl. 35(1): 87-108 (2006) - [j8]Alberto Del Pia, Carlo Filippi:
A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int. Trans. Oper. Res. 13(2): 125-141 (2006) - [j7]David Muñoz de la Peña, Alberto Bemporad, Carlo Filippi:
Robust explicit MPC based on approximate multiparametric convex programming. IEEE Trans. Autom. Control. 51(8): 1399-1403 (2006) - 2005
- [j6]Carlo Filippi:
A fresh view on the tolerance approach to sensitivity analysis in linear programming. Eur. J. Oper. Res. 167(1): 1-19 (2005) - [j5]Carlo Filippi, Alessandro Agnetis:
An asymptotically exact algorithm for the high-multiplicity bin packing problem. Math. Program. 104(1): 21-37 (2005) - 2004
- [j4]Alberto Bemporad, Carlo Filippi, Fabio Danilo Torrisi:
Inner and outer approximations of polytopes using boxes. Comput. Geom. 27(2): 151-178 (2004) - [c2]David Muñoz de la Peña, Alberto Bemporad, Carlo Filippi:
Robust explicit MPC based on approximate multi-parametric convex programming. CDC 2004: 2491-2496 - 2002
- [j3]Carlo Filippi, Giorgio Romanin-Jacur:
Multiparametric demand transportation problem. Eur. J. Oper. Res. 139(2): 206-219 (2002) - 2001
- [c1]Alberto Bemporad, Carlo Filippi:
Suboptimal explicit MPC via approximate multiparametric quadratic programming. CDC 2001: 4851-4856
1990 – 1999
- 1999
- [j2]Carlo Filippi:
A reverse search algorithm for the neighborhood problem. Oper. Res. Lett. 25(1): 33-37 (1999) - 1996
- [j1]Carlo Filippi, Giorgio Romanin-Jacur:
Optimal Allocation of Two Fixed Service Units Acting as M/G/1 Queues. Transp. Sci. 30(1): 60-74 (1996)
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-04-24 22:46 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:
