RINALDI, GIOVANNI
RINALDI, GIOVANNI
Istituto di Analisi dei Sistemi ed Informatica ''Antonio Ruberti'' - IASI
Optimal patchings for consecutive ones matrices
2022 Pfetsch M.E.; Rinaldi G.; Ventura P.
Preface: Combinatorial Optimization ISCO 2018
2022 Lee, J; Mahjoub, Ar; Rinaldi, G
New heuristics for the Max-Cut problem
2021 C. Gentile; G. Rinaldi; E. Salgado
Quantum Annealing versus Digital Computing: An Experimental Comparison
2021 Junger, M; Lobe, E; Mutzel, P; Reinelt, G; Rendl, F; Rinaldi, G; Stollenwerk, T
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
2019 Michael Jünger; Elisabeth Lobe; Petra Mutzel; Gerhard Reinelt; Franz Rendl; Giovanni Rinaldi; Tobias Stollenwerk
Urban Intelligence: A Modular, Fully Integrated, and Evolving Model for Cities Digital Twinning
2019 Castelli Giordana ; Tognola Gabriella ; Campana Emilio Fortunato ; Cesta Amedeo ; Diez Matteo ; Padula Marco ; Ravazzani Paolo ; Rinaldi Giovanni ; Savazzi Stefano ; Spagnuolo Michela ; Strambini Lucanos
OPTIMAL PATCHINGS FOR CONSECUTIVE ONES MATRICES
2018 E Pfetsch, Marc; Rinaldi, Giovanni; Ventura, Paolo
Preface ISCO 2018
2018 Lee; J.a; Rinaldi; G.b; Mahjoub; A.R.c
Combinatorial Optimization
2015 A.R. Mahjoub; G. Rinaldi; G. Woeginger
Preface
2015 Mahjoub, A Ridha; Rinaldi, Giovanni; Woeginger, Gerhard
Lifting and Separation Procedures for the Cut Polytope
2014 Bonato, Thorsten; Juenger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni
A heuristic and an exact method for the gate matrix connection cost minimization problem
2013 De Giovanni, L; Massi, G; Pezzella, F; Pfetsch, Me; Rinaldi, G; Ventura, P
Traveling Salesman Problem
2013 Hoffman, K; Padberg, M; Rinaldi, G
Computational Approaches to Max-Cut
2012 Palagi, L; Piccialli, V; Rendl, F; Rinaldi, G; Wiegele, A
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
2012 Grippo, L; Palagi, L; Piacentini, M; Piccialli, V; Rinaldi, G
Lifting and separation procedures for the cut polytope
2011 Bonato, T. ; Jünger, M.; Reinelt, G.; Rinaldi, G.
SpeeDP: An algorithm to compute SDP bounds for very large Max-Cut instances
2011 Grippo, L; Palagi, L; Piacentini, M; Piccialli, V; Rinaldi, G
50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art
2010 Jünger, M; Liebling, T; Naddef, D; Nemhauser, G; Pulleyblank, W; Reinelt, G; Rinaldi, G; Wolsey, La
Combinatorial Optimization and Integer Programming
2010 Jünger, M.; Liebling, T.; Naddef, D.; Pulleyblank, W.; Reinelt, G.; Rinaldi, G.; Wolsey, L.A.
Computational approaches to Max-Cut
2010 Palagi, L; Piccialli, V; Rendl, F; Rinaldi, G; Wiegele, A
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Optimal patchings for consecutive ones matrices | 1-gen-2022 | Pfetsch M.E.; Rinaldi G.; Ventura P. | |
| Preface: Combinatorial Optimization ISCO 2018 | 1-gen-2022 | Lee, J; Mahjoub, Ar; Rinaldi, G | |
| New heuristics for the Max-Cut problem | 1-gen-2021 | C. Gentile; G. Rinaldi; E. Salgado | |
| Quantum Annealing versus Digital Computing: An Experimental Comparison | 1-gen-2021 | Junger, M; Lobe, E; Mutzel, P; Reinelt, G; Rendl, F; Rinaldi, G; Stollenwerk, T | |
| Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs | 1-gen-2019 | Michael Jünger; Elisabeth Lobe; Petra Mutzel; Gerhard Reinelt; Franz Rendl; Giovanni Rinaldi; Tobias Stollenwerk | |
| Urban Intelligence: A Modular, Fully Integrated, and Evolving Model for Cities Digital Twinning | 1-gen-2019 | Castelli Giordana ; Tognola Gabriella ; Campana Emilio Fortunato ; Cesta Amedeo ; Diez Matteo ; Padula Marco ; Ravazzani Paolo ; Rinaldi Giovanni ; Savazzi Stefano ; Spagnuolo Michela ; Strambini Lucanos | |
| OPTIMAL PATCHINGS FOR CONSECUTIVE ONES MATRICES | 1-gen-2018 | E Pfetsch, Marc; Rinaldi, Giovanni; Ventura, Paolo | |
| Preface ISCO 2018 | 1-gen-2018 | Lee; J.a; Rinaldi; G.b; Mahjoub; A.R.c | |
| Combinatorial Optimization | 1-gen-2015 | A.R. Mahjoub; G. Rinaldi; G. Woeginger | |
| Preface | 1-gen-2015 | Mahjoub, A Ridha; Rinaldi, Giovanni; Woeginger, Gerhard | |
| Lifting and Separation Procedures for the Cut Polytope | 1-gen-2014 | Bonato, Thorsten; Juenger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni | |
| A heuristic and an exact method for the gate matrix connection cost minimization problem | 1-gen-2013 | De Giovanni, L; Massi, G; Pezzella, F; Pfetsch, Me; Rinaldi, G; Ventura, P | |
| Traveling Salesman Problem | 1-gen-2013 | Hoffman, K; Padberg, M; Rinaldi, G | |
| Computational Approaches to Max-Cut | 1-gen-2012 | Palagi, L; Piccialli, V; Rendl, F; Rinaldi, G; Wiegele, A | |
| SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances | 1-gen-2012 | Grippo, L; Palagi, L; Piacentini, M; Piccialli, V; Rinaldi, G | |
| Lifting and separation procedures for the cut polytope | 1-gen-2011 | Bonato, T. ; Jünger, M.; Reinelt, G.; Rinaldi, G. | |
| SpeeDP: An algorithm to compute SDP bounds for very large Max-Cut instances | 1-gen-2011 | Grippo, L; Palagi, L; Piacentini, M; Piccialli, V; Rinaldi, G | |
| 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art | 1-gen-2010 | Jünger, M; Liebling, T; Naddef, D; Nemhauser, G; Pulleyblank, W; Reinelt, G; Rinaldi, G; Wolsey, La | |
| Combinatorial Optimization and Integer Programming | 1-gen-2010 | Jünger, M.; Liebling, T.; Naddef, D.; Pulleyblank, W.; Reinelt, G.; Rinaldi, G.; Wolsey, L.A. | |
| Computational approaches to Max-Cut | 1-gen-2010 | Palagi, L; Piccialli, V; Rendl, F; Rinaldi, G; Wiegele, A |