Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.

This paper addresses the problem of guaranteeing efficient inland waterway transport in presence sequential movable bridges, which must be operated to grant vessel passage. The main contribution is formulation passage scheduling as a mixed-integer programming problem. algorithm receives widths and voyage plans, determines feasible through bridges that best matches plans. Process optimization ca...

<abstract><p>In this manuscript, we consider well-known multi-task learning (MTL) models from the literature for linear regression problems, such as clustered MTL or weakly constrained MTL. We propose novel reformulations of training problem these models, based on mixed-integer quadratic programming (MIQP) techniques. show that our approach allows to drive optimization process up ce...