๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational experience with a SDP-based algorithm for maximum cut with limited unbalance

โœ Scribed by Giulia Galbiati; Stefano Gualandi; Francesco Maffioli

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
299 KB
Volume
55
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computational Experience with a Parallel
Computational Experience with a Parallel Algorithm for Tetrangle Inequality Bound Smoothing
โœ Kumar Rajan; Narsingh Deo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer ๐ŸŒ English โš– 195 KB

Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances can usually be obtained only for a small subset of the n(n-1) 2 atom pairs, using NMR. Given the bounds so obtained on th