For any futed dimension d, the linear programming problem with IZ inequality con-straints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time. The algorithm always finds the correct solution. With nd/log % processors, the probability that the algorithm will not finish withm O(d'1og2d) time tends to zero exponentially with n
AbstractTwo-variable linear programming is a fundamental problem in computational geometry. Sequenti...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
We study the design of nearly-linear-time algorithms for approximately solving positive linear progr...
We describe a deterministic parallel algorithm for linear programming in fixed dimension d that take...
Abstract. It is demonstrated hat he linear programming problem in d variables and n constraints can ...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
We show that with recently developed derandomization tech-niques, one can convert Clarkson’s randomi...
Let A be any fixed cut-off restart algorithm running in parallel on multiple processors. If the algo...
This study developed a parallel algorithm to efficiently solve linear programming models. The propos...
AbstractWe present a new linear-programming algorithm that is simple, effective, fully parallelizabl...
We consider the parallel machine scheduling problem of minimizing the sum of quadratic job completio...
This thesis presents a new parallel algorithm for solving the linear programming problem in $R sp{d}...
We introduce a parallel machine scheduling problem in which the processing times of jobs are not giv...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
Linear programming has many important practical applications, and has also given rise to a wide body...
AbstractTwo-variable linear programming is a fundamental problem in computational geometry. Sequenti...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
We study the design of nearly-linear-time algorithms for approximately solving positive linear progr...
We describe a deterministic parallel algorithm for linear programming in fixed dimension d that take...
Abstract. It is demonstrated hat he linear programming problem in d variables and n constraints can ...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
We show that with recently developed derandomization tech-niques, one can convert Clarkson’s randomi...
Let A be any fixed cut-off restart algorithm running in parallel on multiple processors. If the algo...
This study developed a parallel algorithm to efficiently solve linear programming models. The propos...
AbstractWe present a new linear-programming algorithm that is simple, effective, fully parallelizabl...
We consider the parallel machine scheduling problem of minimizing the sum of quadratic job completio...
This thesis presents a new parallel algorithm for solving the linear programming problem in $R sp{d}...
We introduce a parallel machine scheduling problem in which the processing times of jobs are not giv...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
Linear programming has many important practical applications, and has also given rise to a wide body...
AbstractTwo-variable linear programming is a fundamental problem in computational geometry. Sequenti...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
We study the design of nearly-linear-time algorithms for approximately solving positive linear progr...
DOI
Add to ORKG