FlexRay is getting popular among car makers to be used as a communication backbone for in-vehicle networking systems. It serves both time-triggered as well as event-triggered applications by maintaining static and dynamic segments in its communication cycle. There are many works on the scheduling of the signals that are motivated by different vehicular applications. In this survey the focus is ...

in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

we study the problem of reconstructing binary images from four projections data in a fuzzy environment. given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. we provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

Document mentioned in title of this article was published in first version in 2004. In moment research was started version revised on 16.01.2006 was available and this article refers mainly to that version. At this moment newer version revised on 16.10.2006 is available, but main idea is same. This article contains formulation of TSP 2 problem. Then problem is modeled as Integer Linear Programm...

a procedure is presented that synthesizes fractional crystallization separation processes to obtain pure solids from multi-component solutions. the method includes a procedure to generate a network flow model to identify alternative process designs for fractional crystallization. the main advantage of this systematic procedure with respect to other reported procedures is using non-equilibrium s...

We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems.

Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such as non-projective dependency parsing and machine translation, the complete formulation of the decoding problem as an integer linear program renders solving intractable. We present an approach which solves the problem in...