See this document in CiteSeerX!

The Molecule Problem Exploiting Structure in Global Optimization (1995)  (Make Corrections)  (14 citations)
Bruce Hendrickson
SIAM Journal on Optimization



  Home/Search   Context   Related

 
View or download:
139.179.10.16/prv/ftp/Report...mol.ps.z
sandia.gov/pub/papers/bahen...mol.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  139.179.10.16/prv/ftp/Reports/... (more)
From:  sandia.gov/~bahendr/papers
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . The molecule problem is that of determining the relative locations of a set of objects in Euclidean space relying only upon a sparse set of pairwise distance measurements. This NP--hard problem has applications in the determination of molecular conformation. The molecule problem can be naturally expressed as a continuous, global optimization problem, but it also has a rich combinatorial structure. This paper investigates how that structure can be exploited to simplify the optimization... (Update)

Cited by:   More
Euclidean Distance Matrices - And The Molecular   (Correct)
Planar Embeddings of Graphs with Specified Edge Lengths - Cabello, Demaine, Rote   (Correct)
A Branch-And-Prune Algorithm For The Molecular Distance.. - Liberti, Lavor, Maculan (2006)   (Correct)

Active bibliography (related documents):   More   All
3.1:   Conditions For Unique Graph Realizations - Hendrickson (1992)   (Correct)
0.7:   An Algorithm for Two Dimensional Rigidity Percolation: The.. - Jacobs, Hendrickson (1997)   (Correct)
0.6:   A Large-Scale Stochastic-Perturbation Global Optimization.. - Byrd, Eskow, Schnabel (1999)   (Correct)

Similar documents based on text:   More   All
0.0:   Protein Folding by Restrained Energy Minimization and Molecular.. - Levitt (1983)   (Correct)
0.0:   A Branch-and-Bound Constraint Optimization Approach to the.. - Rolf Backofen And   (Correct)
0.0:   Constraint Techniques for Solving the Protein Structure.. - Backofen (1998)   (Correct)

Related documents from co-citation:   More   All
11:   Embeddability of weighted graphs in k-space is strongly NP-hard (context) - Saxe - 1979
11:   Distance geometry and molecular conformation (context) - Crippen, Havel - 1988
7:   Solving Euclidean distance matrix completion problems via semidefinite programmi.. - ALFAKIH, KHANDANI et al. - 1997

BibTeX entry:   (Update)

B.A.Hendrickson, The Molecule Problem: Exploiting Structure in Global Optimization, SIAM J. Optimization, Vol. 5(1995), No.4, pp. 835-857. http://citeseer.ist.psu.edu/hendrickson95molecule.html   More

@article{ hendrickson95molecule,
    author = "B. Hendrickson",
    title = "The molecule problem: Exploiting structure in global optimization",
    journal = "SIAM Journal on Optimization",
    volume = "5",
    pages = "835--857",
    year = "1995",
    url = "citeseer.ist.psu.edu/hendrickson95molecule.html" }
Citations (may not include all citations):
1450   The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
98   Computing a trust region step (context) - Mor'e, Sorensen - 1983
77   Dividing a graph into triconnected components (context) - Hopcroft, Tarjan - 1973
67   A unified geometric approach to graph separators (context) - Miller, Teng et al. - 1991
49   Reidel Publishing Company (context) - van Laarhoven, Aarts et al. - 1987
35   On graphs and rigidity of plane skeletal structures (context) - Laman - 1970
28   Embeddability of weighted graphs in k-space is strongly NP-h.. (context) - Saxe - 1979
26   A graph partitioning algorithm by node separators (context) - Liu - 1989
18   Improved algorithms for graph four-connectivity (context) - Kanevsky, Ramachandran - 1987
13   The Molecule Problem: Determining Conformation from Pairwise.. (context) - Hendrickson - 1990
12   A stochastic approach to global optimization (context) - Kan, Timmer - 1984
9   Concurrent stochastic methods for global optimization (context) - Byrd, Dert et al. - 1990
8   The rigidity of graphs (context) - Asimow, Roth - 1978
7   Almost all simply connected closed surfaces are rigid (context) - Gluck - 1975
7   On combinatorial structures of line drawings of polyhedra (context) - Imai - 1985
6   Protein folding: deciphering the second half of the genetic .. (context) - Gierasch, King - 1989
5   Rigid and flexible frameworks (context) - Roth - 1981
5   frames and games: Algorithms for matroid sums and applicatio.. (context) - Gabow, Westermann - 1988
3   Research Studies Press Ltd (context) - Crippen, Havel et al. - 1988
3   Personal communication (context) - Connelly - 1989
2   The development of nuclear magnetic resonance spectroscopy a.. (context) - utrich - 1989
2   On determining vertex connectivity (context) - Cheriyan, Thurimella - 1990
2   Einige grundaufgaben der raumlichen trilateration und ihre g.. (context) - Killian, Meissl - 1969
2   The tunneling algorithms for the global minimizer of functio.. (context) - Levy, Montalvo - 1985
2   Untersuchungen zu einem trilaterations problem mit komplaner.. (context) - Wunderlich - 1977
2   Topologie Structurale (context) - Crapo, rigidity - 1979
1   Chemistry Department (context) - Palmer, communication - 1990
1   Standard--geometry chains fitted to X--ray derived structure.. (context) - Palmer, Scheraga - 1992



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://139.179.10.16/prv/ftp/Reports/sandia/):   More
An Efficient Parallel Algorithm for Matrix-Vector.. - Hendrickson, Leland.. (1995)   (Correct)
Parallel Many-Body Simulations Without All-to-All.. - Bruce Hendrickson.. (1993)   (Correct)
The Torus-Wrap Mapping For Dense Matrix Calculations On.. - Hendrickson, Womble (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC