REPORT procedure creating listings

The basic ideas in a branch and bound algorithm are outlined in the following. First we make a reasonable effort to solve the original problem (e.g., considering a relaxation of it). If the relaxation does not result in a 0 - 1 solution for the y-variables, then we separate the root node into two or more candidate subproblems at level 1 and create a list of candidate subproblems. We select one of the candidate subproblems of level 1, we attempt to solve it, and if its solution is integral, then we return to the candidate list of subproblems and select a new candidate subproblem. Otherwise, we separate the candidate subproblem into two or more subproblems at level 2 and add its children nodes to the list of candidate subproblems. We continue this procedure until the candidate list is exhausted and report as optimal solution the current incumbent. Note that the finite termination of such a procedure is attained if the set of feasible solutions of the original problem (P), denoted as FS(P) is finite. 

In this contribution, only those inelastic static methods that are included or referred to in the codes and national guidelines are presented. Quite a Iraig list of other inelastic static procedures currently available in the literature can be created. Some of them are general, and some are specialized for certain types of stmctures. Many of them are presented in different state-of-tfie art reports (e.g., FEMA 440 2005 CEB-FIB 2003 Kappos et al. 2012, etc.) or other specialized literature (e.g., Bhatt 2011). 

---