A zero one programming model for RNA structures with arclength ≥ 4
Authors
Abstract:
In this paper, we consider RNA structures with arc-length 4 . First, we represent these structures as matrix models and zero-one linearprogramming problems. Then, we obtain an optimal solution for this problemusing an implicit enumeration method. The optimal solution corresponds toan RNA structure with the maximum number of hydrogen bonds.
similar resources
a zero one programming model for rna structures with arclength ≥ 4
in this paper, we consider rna structures with arc-length 4 . first, we represent thesestructures as matrix models and zero-one linearprogramming problems. then, we obtain anoptimal solution for this problemusing an implicit enumeration method. the optimal solutioncorresponds toan rna structure with the maximum number of hydrogen bonds.
full textA Comprehensive Model for R and D Project Portfolio Selection with Zero-One Linear Goal-Programming (RESEARCH NOTE)
Technology centered organizations must be able to identify promising new products or process improvements at an early stage so that the necessary resources can be allocated to those activities. It is essential to invest in targeted research and development (R and D) projects as opposed to a wide range of ideas so that resources can be focused on successful outcomes. The selection of the most ap...
full textinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Convex land acquisition with zero ^ one programming
The land-acquisition problem involves selecting multiple discrete parcels to be acquired for a particular land use. In previous models, typical selection criteria have been land cost, land area, and spatial attributes such as contiguity and compactness. Here I introduce a new spatial attribute, convexity. I develop a way to approximate convex shapes in continuous space with `cellularly convex' ...
full textContinuous Reformulations for Zero-one Programming Problems
In this work, we study continuous reformulations of zero–one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero–one programming problem can be obtained by solving a specific continuous problem.
full textSolving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function
Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables. In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.
full textMy Resources
Save resource for easier access later
Save to my libraryJournal title
volume 3 issue 2
pages 185- 193
publication date 2012-09-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023