The following pages link to Giovanni Rinaldi (Q403652):
Displaying 39 items.
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- Primal separation for 0/1 polytopes (Q1396830) (← links)
- Minimizing breaks by maximizing cuts. (Q1400343) (← links)
- On the cut polyhedron. (Q1426123) (← links)
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs (Q1849260) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Exact ground states of two-dimensional \(\pm J\) Ising spin glasses (Q1946872) (← links)
- Practical performance of efficient minimum cut algorithms (Q1969951) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm (Q2500052) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Traces of the XII Aussois Workshop on combinatorial optimization (Q2638379) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- (Q3181648) (← links)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems (Q3362088) (← links)
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case (Q3544267) (← links)
- A function space approach to the foundations of system theory (Q3671810) (← links)
- Scheduling tasks with sequence-dependent processing times (Q3786260) (← links)
- Branch-and-cut approach to a variant of the traveling salesman problem (Q3812063) (← links)
- The Crown Inequalities for the Symmetric Traveling Salesman Polytope (Q4016696) (← links)
- (Q4398370) (← links)
- (Q4411388) (← links)
- (Q4532225) (← links)
- (Q4668573) (← links)
- The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities (Q4717570) (← links)
- (Q4735939) (← links)
- (Q4828942) (← links)
- (Q4829031) (← links)
- (Q4845366) (← links)
- Quantum Annealing versus Digital Computing (Q5102052) (← links)
- The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation (Q5388027) (← links)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations (Q5429275) (← links)
- (Q5465110) (← links)
- Integer Programming and Combinatorial Optimization (Q5712472) (← links)
