Then, a binary linear program is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the binary program are derived ...

Since its formulation from 1930 to 1940 and the development of the Simplex method of Dantzig in 1949 [1] [6] , researchers in various fields have been led to formulate and solve linear problems.

F. Polimeno, T. Rehman, H. Neal, C. M. Yates, Integrating the use of Linear and Dynamic Programming Methods for Diary Cow Diet Formulation, The Journal of the ...

There is a need for design strategies that can support rapid and widespread deployment of new energy systems and process technologies. In a previous work, we introduced process family design as an ...

The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tree-based” linear ...

Here, we present a critical finding that the network flow structure embedded in the integer linear programming formulation of the computational protein design problem makes it equivalent to a ...

The method relies on a linear programming formulation of a process exiting from a bounded domain. The LP formulation characterizes the evolution of the process through the moments of the induced ...