default search action
Riccardo Cambini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j19]Riccardo Cambini, Rossana Riccardi, Domenico Scopelliti:
Solving linear multiplicative programs via branch-and-bound: a computational experience. Comput. Manag. Sci. 20(1): 38 (2023)
2010 – 2019
- 2018
- [j18]Pankaj Gupta, Riccardo Cambini, S. S. Appadoo:
Recent advances in optimization theory and applications (RAOTA-2016). Ann. Oper. Res. 269(1-2): 1-2 (2018) - [j17]Manuel Arana-Jiménez, Riccardo Cambini, Laura Carosi:
A reduced formulation for pseudoinvex vector functions. Ann. Oper. Res. 269(1-2): 21-27 (2018) - 2017
- [j16]Riccardo Cambini, Laura Carosi, Laura Martein, Ezat Valipour:
Simplex-like sequential methods for a class of generalized fractional programs. Math. Methods Oper. Res. 85(1): 77-96 (2017) - 2014
- [j15]Riccardo Cambini, Claudio Sodini:
A parametric solution algorithm for a class of rank-two nonconvex programs. J. Glob. Optim. 60(4): 649-662 (2014) - 2013
- [j14]Manuel Arana-Jiménez, Riccardo Cambini, Antonio Rufián-Lizana:
C-efficiency in nondifferentiable vector optimization. Math. Comput. Model. 57(5-6): 1148-1153 (2013) - 2012
- [j13]Riccardo Cambini, Claudio Sodini:
A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs. J. Comput. Appl. Math. 236(10): 2685-2695 (2012) - 2010
- [j12]Riccardo Cambini, Claudio Sodini:
A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions. Eur. J. Oper. Res. 207(1): 25-29 (2010) - [j11]Riccardo Cambini, Claudio Sodini:
Global optimization of a rank-two nonconvex program. Math. Methods Oper. Res. 71(1): 165-180 (2010) - [j10]Riccardo Cambini, Francesca Salvi:
Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience. Oper. Res. Lett. 38(5): 354-357 (2010)
2000 – 2009
- 2009
- [j9]Riccardo Cambini, Rossana Riccardi:
Theoretical and algorithmic results for a class of hierarchical fleet mix problems. Eur. J. Oper. Res. 198(3): 741-747 (2009) - [j8]Riccardo Cambini, Francesca Salvi:
A branch and reduce approach for solving a class of low rank d.c. programs. J. Comput. Appl. Math. 233(2): 492-501 (2009) - 2008
- [j7]Riccardo Cambini, Claudio Sodini:
A computational comparison of some branch and bound methods for indefinite quadratic programs. Central Eur. J. Oper. Res. 16(2): 139-152 (2008) - [j6]Riccardo Cambini, Claudio Sodini:
A sequential method for a class of box constrained quadratic programming problems. Math. Methods Oper. Res. 67(2): 223-243 (2008) - 2005
- [j5]Riccardo Cambini, Claudio Sodini:
Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound. J. Glob. Optim. 33(3): 313-336 (2005) - 2004
- [j4]Riccardo Cambini, Laura Carosi:
On Generalized Linearity of Quadratic Fractional Functions. J. Glob. Optim. 30(2-3): 235-251 (2004) - 2003
- [j3]Riccardo Cambini, Claudio Sodini:
A Finite Algorithm for a Class of Nonlinear Multiplicative Programs. J. Glob. Optim. 26(3): 279-296 (2003) - 2002
- [j2]Riccardo Cambini, Claudio Sodini:
A Finite Algorithm for a Particular D.C. Quadratic Programming Problem. Ann. Oper. Res. 117(1-4): 33-49 (2002)
1990 – 1999
- 1997
- [j1]Riccardo Cambini, Giorgio Gallo, Maria Grazia Scutellà:
Flows on hypergraphs. Math. Program. 77: 195-217 (1997)
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:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint