An Algorithmic Solution of a Birkhoff Type Problem
نویسندگان
چکیده
We give an algorithmic solution in a simple combinatorial data of Birkhoff′s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over the K-algebra K[t]/(tm), where m ≥ 2, I is a finite poset with a unique maximal element, and K is an algebraically closed field.
منابع مشابه
Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study
Following the work of Gonzalez-Vega, this paper is devoted to show how to use recent algorithmic tools of computational real algebraic geometry to solve the Birkhoff Interpolation Problem. We recall and partly improve two algorithms to find at least one point in each connected component of a real algebraic set defined by a single equation or a polynomial system of equations, both based on the c...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملNatural splines of Birkhoff type approximating the solution of differential equations 1
Let us consider the following initial value problem (1)
متن کاملMinimizing the Mean Tardiness in A N1 Sequencing Problem
This paper considers the problem of minimizing the mean tardiness of N jobs when the jobs are scheduled on a single machine. A simple algorithmic procedure is develop to obtain an optimal or a near optimal sequence for the N jobs while considering an equal penalty cost incurred to each job delivered later than its due date. The developed algorithm is applied to the several test problems. The re...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 83 شماره
صفحات -
تاریخ انتشار 2008