default search action
Giovanni Rinaldi
Person information
- affiliation: Consiglio Nazionale delle Ricerche, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j30]Jon Lee, Ali Ridha Mahjoub, Giovanni Rinaldi:
Preface: Combinatorial Optimization ISCO 2018. Discret. Appl. Math. 308: 1-3 (2022) - [j29]Marc E. Pfetsch
, Giovanni Rinaldi, Paolo Ventura:
Optimal patchings for consecutive ones matrices. Math. Program. Comput. 14(1): 43-84 (2022) - 2021
- [j28]Michael Jünger, Elisabeth Lobe
Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26: 1.9:1-1.9:30 (2021)
2010 – 2019
- 2019
- [c13]Giovanni Rinaldi, Marco Manca
The International Register of Ideas and Innovations. A Visionary Social Network to Develop Innovation and Protect IP Using Blockchain and Proof-of-Originality Algorithm. INSCI 2019: 275-282 - [i1]Michael Jünger, Elisabeth Lobe
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR abs/1904.11965 (2019) - 2018
- [e5]Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub:
Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers. Lecture Notes in Computer Science 10856, Springer 2018, ISBN 978-3-319-96150-7 [contents] - 2015
- [j27]Ali Ridha Mahjoub, Giovanni Rinaldi
Preface. Math. Program. 150(1): 1-3 (2015) - 2014
- [j26]Thorsten Bonato, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
Lifting and separation procedures for the cut polytope. Math. Program. 146(1-2): 351-378 (2014) - 2013
- [j25]Luigi De Giovanni, G. Massi, Ferdinando Pezzella, Marc E. Pfetsch
A heuristic and an exact method for the gate matrix connection cost minimization problem. Int. Trans. Oper. Res. 20(5): 627-643 (2013) - 2012
- [j24]Luigi Grippo, Laura Palagi
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances. Math. Program. 136(2): 353-373 (2012) - 2010
- [j23]Franz Rendl, Giovanni Rinaldi
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121(2): 307-335 (2010) - [j22]Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010) - [e4]Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. Springer 2010, ISBN 978-3-540-68274-5 [contents]
2000 – 2009
- 2009
- [j21]Christoph Buchheim, Giovanni Rinaldi:
Terse Integer Linear Programs for Boolean Optimization. J. Satisf. Boolean Model. Comput. 6(1-3): 121-139 (2009) - [c12]Giovanni Rinaldi, Antonio Gaddi, Arrigo F. G. Cicero
A Web2.0 Platform in Healthcare Created on the Basis of the Real Perceived Need of the Elderly End User. eHealth 2009: 173-180 - 2008
- [c11]Giovanni Rinaldi, Mike Martin, Massimo Busuoli:
A Federative Approach For a Virtual Community In Elderly Care: A Different Way In ECare. BIOCOMP 2008: 272-278 - [c10]Christophe Ponsard, Mike Martin, Sarah Walsh, Susan Baines
OLDES: Designing a Low-Cost, Easy-to-Use e-Care System Together with the Stakeholders. ICCHP 2008: 1285-1292 - [e3]Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi:
Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings. Lecture Notes in Computer Science 5035, Springer 2008, ISBN 978-3-540-68886-0 [contents] - 2007
- [j20]Denis Naddef, Giovanni Rinaldi
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation. Math. Oper. Res. 32(1): 233-256 (2007) - [j19]Christoph Buchheim
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case. SIAM J. Optim. 18(4): 1398-1413 (2007) - [c9]Franz Rendl, Giovanni Rinaldi, Angelika Wiegele:
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. IPCO 2007: 295-309 - 2005
- [j18]Devon D. Brewer, Giovanni Rinaldi, Andrei Mogoutov, Thomas W. Valente:
A Quantitative Review of Associative Patterns in the Recall of Persons. J. Soc. Struct. 6 (2005) - [j17]Antonio Frangioni
New approaches for optimizing over the semimetric polytope. Math. Program. 104(2-3): 375-388 (2005) - 2004
- [j16]Michele Conforti, Giovanni Rinaldi
On the cut polyhedron. Discret. Math. 277(1-3): 279-285 (2004) - [c8]Antonio Frangioni
Optimizing over Semimetric Polytopes. IPCO 2004: 431-443 - [p2]Claudio Gentile, Utz-Uwe Haus, Matthias Köppe
On the Way to Perfection: Primal Operations for Stable Sets in Graphs. The Sharpest Cut 2004: 51-76 - 2003
- [j15]S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi
Easy and difficult objective functions for max cut. Math. Program. 94(2-3): 459-466 (2003) - [j14]Friedrich Eisenbrand, Giovanni Rinaldi
Primal separation for 0/1 polytopes. Math. Program. 95(3): 475-491 (2003) - [j13]Matthias Elf, Michael Jünger, Giovanni Rinaldi
Minimizing breaks by maximizing cuts. Oper. Res. Lett. 31(3): 343-349 (2003) - [e2]Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi:
Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers. Lecture Notes in Computer Science 2570, Springer 2003, ISBN 3-540-00580-3 [contents] - 2002
- [j12]Giovanni Rinaldi
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs. Math. Program. 93(1): 77-86 (2002) - [c7]Claudio Gentile, Utz-Uwe Haus, Matthias Köppe
A Primal Approach to the Stable Set Problem. ESA 2002: 525-537 - [c6]Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger:
The mathematics of playing golf. SODA 2002: 265-266 - [c5]Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura:
0/1 optimization and 0/1 primal separation are equivalent. SODA 2002: 920-926 - [p1]Denis Naddef, Giovanni Rinaldi:
Branch-And-Cut Algorithms for the Capacitated VRP. The Vehicle Routing Problem 2002: 53-84 - 2001
- [c4]Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi:
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. Computational Combinatorial Optimization 2001: 157-222 - 2000
- [j11]Michael Jünger, Giovanni Rinaldi
Practical Performance of Efficient Minimum Cut Algorithms. Algorithmica 26(1): 172-195 (2000)
1990 – 1999
- 1997
- [j10]Lorenzo Brunetta, Michele Conforti, Giovanni Rinaldi
A branch-and-cut algorithm for the equicut problem. Math. Program. 77: 243-263 (1997) - [c3]Michael Jünger, Giovanni Rinaldi, Stefan Thienel:
Practical Performance of Efficient Minimum Cut Algorithms. WAE 1997: 42-53 - 1996
- [j9]Sunil Chopra
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities. SIAM J. Discret. Math. 9(4): 602-624 (1996) - [c2]Giovanni Felici, Giovanni Rinaldi, Klaus Truemper:
FasTraC: A Decentralized Traffic Control System Based on Logic Programming. CADE 1996: 216-220 - 1995
- [j8]Mario Lucertini, Giovanni Rinaldi
Preface. Discret. Appl. Math. 62(1-3): 1-3 (1995) - 1993
- [j7]Denis Naddef, Giovanni Rinaldi
The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope. Math. Program. 58: 53-88 (1993) - [e1]Giovanni Rinaldi, Laurence A. Wolsey:
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993. CIACO 1993 [contents] - 1992
- [j6]Denis Naddef, Giovanni Rinaldi
The Crown Inequalities for the Symmetric Traveling Salesman Polytope. Math. Oper. Res. 17(2): 308-326 (1992) - 1991
- [j5]Denis Naddef, Giovanni Rinaldi
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Program. 51: 359-400 (1991) - [j4]Manfred Padberg, Giovanni Rinaldi
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems. SIAM Rev. 33(1): 60-100 (1991) - 1990
- [j3]Manfred Padberg, Giovanni Rinaldi
An Efficient Algorithm for the Minimum Capacity Cut Problem. Math. Program. 47: 19-36 (1990) - [j2]Manfred Padberg, Giovanni Rinaldi
Facet Identification for the Symmetric Traveling Salesman Polytope. Math. Program. 47: 219-257 (1990) - [c1]Sunil Chopra, Giovanni Rinaldi:
The Graphical Asymmetric Traveling Salesman Polyhedron. IPCO 1990: 129-145
1980 – 1989
- 1986
- [j1]Giovanni Rinaldi
A Projective Method for Linear Programming with Box-Type Constraints. Algorithmica 1(4): 517-527 (1986)
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-13 20:42 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: