An Enumerative Algorithm for #2SAT

2014 ◽  
Vol 46 ◽  
pp. 81-88
Author(s):  
Guillermo de Ita Luna ◽  
J. Raymundo Marcial-Romero ◽  
Yolanda Moyao
Top ◽  
2012 ◽  
Vol 22 (2) ◽  
pp. 530-542 ◽  
Author(s):  
Carla Oliveira ◽  
Carlos Henggeler Antunes ◽  
Carlos Barrico

1994 ◽  
Vol 5 (3) ◽  
pp. 277-290 ◽  
Author(s):  
B�la Vizv�ri ◽  
Fatih Yilmaz

2013 ◽  
Vol 59 (1-2) ◽  
pp. 113-134 ◽  
Author(s):  
Luís M. Fernandes ◽  
Joaquim J. Júdice ◽  
Hanif D. Sherali ◽  
Maria A. Forjaz

2011 ◽  
Vol 66-68 ◽  
pp. 1781-1785
Author(s):  
Tian Sheng Shi ◽  
Jin Yu Lu ◽  
Liu Zhen Yao ◽  
Yuan Lin Du

Tensegrity is a novel structure which attracts structure engineers’ interest because of its light weight and efficient structural behavior. Nowadays researches are mainly concentrated in the area of regular and irregular tensegrity, both of which are not suitable in many situations on account of their shapes or member length conditions. Thus, a new concept of semi-regular tensegrity was proposed in this paper. Based on the singular value decomposition of equilibrium matrix, an enumerative algorithm for the form-finding of semi-regular tensegrity was presented. According to the distribution of the minimum singular value of matrix, the configuration of semi-regular tensegrity was discovered. The obtained tensegrity was used as modulus for the generation of single curved cable-strut grid. A numerical example was illustrated to indicate that the proposed tensegrity modulus was feasible and advantageous in constructing single-curved tensegrity grid. Finally, the future research in the area of semi-regular tensegrity and its application was prospected.


2009 ◽  
Vol 19 (2) ◽  
pp. 263-279 ◽  
Author(s):  
Ritu Narang ◽  
S.R. Arora

In this paper a multilevel programming problem, that is, three level programming problem is considered. It involves three optimization problems where the constraint region of the first level problem is implicitly determined by two other optimization problems. The objective function of the first level is indefinite quadratic, the second one is linear and the third one is linear fractional. The feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient sub-matrix associated to the variables of the third level, an enumerative algorithm is proposed, which finds an optimum solution to the given problem. It is illustrated with the help of an example. .


Sign in / Sign up

Export Citation Format

Share Document