Giovanni Rinaldi

Orcid: 0000-0003-0148-2470

Affiliations:
  • Consiglio Nazionale delle Ricerche, Rome, Italy


According to our database1, Giovanni Rinaldi authored at least 45 papers between 1986 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Optimal patchings for consecutive ones matrices.
Math. Program. Comput., 2022

Preface: Combinatorial Optimization ISCO 2018.
Discret. Appl. Math., 2022

2021
Quantum Annealing versus Digital Computing: An Experimental Comparison.
ACM J. Exp. Algorithmics, 2021

2019
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs.
CoRR, 2019

The International Register of Ideas and Innovations. A Visionary Social Network to Develop Innovation and Protect IP Using Blockchain and Proof-of-Originality Algorithm.
Proceedings of the Internet Science - 6th International Conference, 2019

2015
Preface.
Math. Program., 2015

2014
Lifting and separation procedures for the cut polytope.
Math. Program., 2014

2013
A heuristic and an exact method for the gate matrix connection cost minimization problem.
Int. Trans. Oper. Res., 2013

2012
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances.
Math. Program., 2012

2010
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.
Math. Program., 2010

Traces of the XII Aussois Workshop on Combinatorial Optimization.
Math. Program., 2010

2009
Terse Integer Linear Programs for Boolean Optimization.
J. Satisf. Boolean Model. Comput., 2009

A Web2.0 Platform in Healthcare Created on the Basis of the Real Perceived Need of the Elderly End User.
Proceedings of the Electronic Healthcare - Second International ICST Conference, 2009

2008
OLDES: Designing a Low-Cost, Easy-to-Use e-Care System Together with the Stakeholders.
Proceedings of the Computers Helping People with Special Needs, 2008

A Federative Approach For a Virtual Community In Elderly Care: A Different Way In ECare.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008

2007
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case.
SIAM J. Optim., 2007

The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation.
Math. Oper. Res., 2007

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2005
New approaches for optimizing over the semimetric polytope.
Math. Program., 2005

A Quantitative Review of Associative Patterns in the Recall of Persons.
J. Soc. Struct., 2005

2004
On the cut polyhedron.
Discret. Math., 2004

Optimizing over Semimetric Polytopes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

On the Way to Perfection: Primal Operations for Stable Sets in Graphs.
Proceedings of the Sharpest Cut, 2004

2003
Minimizing breaks by maximizing cuts.
Oper. Res. Lett., 2003

Easy and difficult objective functions for max cut.
Math. Program., 2003

Primal separation for 0/1 polytopes.
Math. Program., 2003

2002
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs.
Math. Program., 2002

The mathematics of playing golf.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

0/1 optimization and 0/1 primal separation are equivalent.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

A Primal Approach to the Stable Set Problem.
Proceedings of the Algorithms, 2002

Branch-And-Cut Algorithms for the Capacitated VRP.
Proceedings of the Vehicle Routing Problem., 2002

2001
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.
Proceedings of the Computational Combinatorial Optimization, 2001

2000
Practical Performance of Efficient Minimum Cut Algorithms.
Algorithmica, 2000

1997
A branch-and-cut algorithm for the equicut problem.
Math. Program., 1997

1996
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities.
SIAM J. Discret. Math., 1996

FasTraC: A Decentralized Traffic Control System Based on Logic Programming.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995
Preface.
Discret. Appl. Math., 1995

1993
The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope.
Math. Program., 1993

1992
The Crown Inequalities for the Symmetric Traveling Salesman Polytope.
Math. Oper. Res., 1992

1991
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems.
SIAM Rev., 1991

The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities.
Math. Program., 1991

1990
Facet Identification for the Symmetric Traveling Salesman Polytope.
Math. Program., 1990

An Efficient Algorithm for the Minimum Capacity Cut Problem.
Math. Program., 1990

The Graphical Asymmetric Traveling Salesman Polyhedron.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1986
A Projective Method for Linear Programming with Box-Type Constraints.
Algorithmica, 1986


  Loading...