Local algorithms for block-tree problems of discrete programming

1985 ◽  
Vol 25 (4) ◽  
pp. 114-121 ◽  
Author(s):  
O.A. Shcherbina
Keyword(s):  
Local Algorithms ◽  
Discrete Programming ◽  
Block Tree

Structural learning of Bayesian networks using local algorithms based on the space of orderings

2010 ◽  
Vol 15 (10) ◽  
pp. 1881-1895 ◽  
Author(s):  
Juan I. Alonso-Barba ◽  
Luis delaOssa ◽  
Jose M. Puerta
Keyword(s):  
Bayesian Networks ◽  
Structural Learning ◽  
Local Algorithms

scholarly journals The Structure of Locally Finite Two-Connected Graphs

10.37236/1211 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Carl Droms ◽  
Brigitte Servatius ◽  
Herman Servatius
Keyword(s):  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Locally Finite ◽  
Connected Graphs ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Necessary And Sufficient ◽  
Block Tree ◽  
Labeled Tree

We expand on Tutte's theory of $3$-blocks for $2$-connected graphs, generalizing it to apply to infinite, locally finite graphs, and giving necessary and sufficient conditions for a labeled tree to be the $3$-block tree of a $2$-connected graph.

Nonlinear Integer and Discrete Programming in Mechanical Design

1988 ◽  
Author(s):  
E. Sandgren
Keyword(s):  
Mechanical Design ◽  
General Purpose ◽  
Conceptual Level ◽  
Design Problems ◽  
Design Decisions ◽  
Design Variables ◽  
Nonlinear Mathematical Programming ◽  
Discrete Programming ◽  
Mathematical Programming Problems ◽  
Quadratic Programming Method

Abstract A general purpose algorithm for the solution of nonlinear mathematical programming problems containing integer, discrete, zero-one and continuous design variables is described. The algorithm implements a branch and bound procedure in conjunction with both an exterior penalty function and a quadratic programming method. Variable bounds are handled independently from the design constraints which removes the necessity to reformulate the problem at each branching node. Examples are presented to demonstrate the utility of the algorithm for solving design problems. The use of zero-one variables to represent design decisions in order to allow conceptual level design to be performed is demonstrated.

Sign in / Sign up

Export Citation Format

Share Document