  


Discretization vertex orders in distance geometry
Andrea Cassioli (andrea.cassiolimosek.com) Abstract: When a weighted graph is an instance of the Distance Geometry Problem (DGP), certain types of vertex orders (called discretization orders) allow the use of a very efficient, precise and robust discrete search algorithm (called BranchandPrune). Accordingly, finding such orders is critically important in order to solve DGPs in practice. We discuss three types of discretization orders, the complexity of determining their existence in a given graph, and the inclusion relations between the three order existence problems. We also give three mathematical programming formulations of some of these ordering problems. Keywords: molecular conformation, protein, DDGP, DMDGP, reorder, BranchandPrune Category 1: Combinatorial Optimization (Other ) Category 2: Applications  Science and Engineering (Biomedical Applications ) Category 3: Integer Programming (01 Programming ) Citation: Download: [PDF] Entry Submitted: 08/23/2014 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  