default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranca Rinaldi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Dario Fasino
, Franca Rinaldi:
A Fast and Exact Greedy Algorithm for the Core-Periphery Problem. Symmetry 12(1): 94 (2020)- [c5]Giuseppe Lancia, Eleonora Pippia, Franca Rinaldi:
Using Integer Programming to Search for Counterexamples: A Case Study. MOTOR 2020: 69-84
2010 – 2019
- 2017
- [j14]Franca Rinaldi, Romeo Rizzi:
Solving the train marshalling problem by inclusion-exclusion. Discret. Appl. Math. 217: 685-690 (2017) - 2015
- [j13]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
Local search inequalities. Discret. Optim. 16: 76-89 (2015) - [j12]Enrico Bozzo, Massimo Franceschet, Franca Rinaldi:
Vulnerability and power on networks. Netw. Sci. 3(2): 196-226 (2015) - [c4]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
A Unified Integer Programming Model for Genome Rearrangement Problems. IWBBIO (1) 2015: 491-502 - 2013
- [i1]Enrico Bozzo, Massimo Franceschet, Franca Rinaldi:
Vulnerability and power on networks. CoRR abs/1312.5598 (2013) - 2011
- [j11]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
A time-indexed LP-based approach for min-sum job-shop problems. Ann. Oper. Res. 186(1): 175-198 (2011)
2000 – 2009
- 2008
- [j10]Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi:
Flipping Letters to minimize the Support of a String. Int. J. Found. Comput. Sci. 19(1): 5-17 (2008) - 2007
- [j9]Franca Rinaldi, Annamaria Franz:
A two-dimensional strip cutting problem with sequencing constraint. Eur. J. Oper. Res. 183(3): 1371-1384 (2007) - 2006
- [j8]Raffaele Pesenti, Franca Rinaldi:
The Image Containment Problem and Some Classes of Polynomial Instances. SIAM J. Optim. 17(4): 1189-1204 (2006) - [c3]Franca Rinaldi, Paolo Serafini:
Scheduling School Meetings. PATAT 2006: 280-293 - [c2]Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi:
Flipping letters to minimize the support of a string. Stringology 2006: 9-17 - 2004
- [j7]Franco Blanchini, Stefano Miani, Franca Rinaldi:
Guaranteed cost control for multi-inventory systems with uncertain demand. Autom. 40(2): 213-223 (2004) - [j6]Raffaele Pesenti, Franca Rinaldi, Walter Ukovich:
An exact algorithm for the min-cost network containment problem. Networks 43(2): 87-102 (2004) - 2003
- [j5]Franco Blanchini, Stefano Miani, Raffaele Pesenti, Franca Rinaldi:
Stabilization of multi-inventory systems with uncertain demand and setups. IEEE Trans. Robotics Autom. 19(1): 103-116 (2003) - 2001
- [c1]Franco Blanchini, Stefano Miani, Raffaele Pesenti, Franca Rinaldi:
Control policies for multi-inventory systems with uncertain demand and setups. CDC 2001: 1941-1946 - 2000
- [j4]Franco Blanchini, Raffaele Pesenti, Franca Rinaldi, Walter Ukovich:
Feedback control of production-distribution systems with unknown demand and delays. IEEE Trans. Robotics Autom. 16(3): 313-317 (2000)
1990 – 1999
- 1997
- [j3]Franco Blanchini, Franca Rinaldi, Walter Ukovich:
A Network Design Problem for a Distribution System with Uncertain Demands. SIAM J. Optim. 7(2): 560-578 (1997) - [j2]Franco Blanchini, Franca Rinaldi, Walter Ukovich:
Least inventory control of multistorage systems with non-stochastic unknown inputs. IEEE Trans. Robotics Autom. 13(5): 633-645 (1997) - 1996
- [j1]Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich:
A feedback strategy for periodic network flows. Networks 27(1): 25-34 (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 2025-01-09 13:03 CET 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:
