Results 191 to 200 of about 19,840 (247)

First Record of <i>Ixodes ariadnae</i> (Acari: Ixodidae) in Slovakia. [PDF]

open access: yesAnimals (Basel)
Lipinský J   +11 more
europepmc   +1 more source

Probing omics data via harmonic persistent homology. [PDF]

open access: yesSci Rep
Gurnari D   +5 more
europepmc   +1 more source

An overview on the simplex algorithm

Applied Mathematics and Computation, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hedi Nabli
exaly   +3 more sources

A Bidirectional Simplex Algorithm

Journal of the ACM, 1968
A simplex type algorithm is presented which deals uniformly with (a) ordinary linear programming problems, (b) problems with upper bounded variables, and (c) problems with convex piecewise linear objective functions, e.g., absolute value terms. Problems of types (b) and (c) can be solved by suitable transformations into ordinary linear programming ...
Alex Orden, V. Nalbandian
openaire   +1 more source

The Scaling Network Simplex Algorithm

Operations Research, 1992
In this paper, we present a new primal simplex pivot rule and analyze the worst case complexity of the resulting simplex algorithm for the minimum cost flow, the assignment, and the shortest path problems. We consider networks with n nodes, m arcs, integral arc capacities bounded by an integer number U, and integral arc costs whose magnitudes are ...
Ravindra K. Ahuja, James B. Orlin
openaire   +2 more sources

A systolic simplex algorithm

International Journal of Computer Mathematics, 1991
In this paper a systolic algorithm is presented for the Simplex algorithm as used in Linear Programming applications. In addition, to reduce computer storage requirements, a revised form of the algorithm is considered for systolic array implementation using the product form of the inverse.
David J. Evans 0001, Graham M. Megson
openaire   +1 more source

A VLSI Implementation of the Simplex Algorithm

IEEE Transactions on Computers, 1987
The use of a special-purpose VLSI chip for solving a linear programming problem is presented. The chip is structured as a mesh of trees and is designed to implement the well-known simplex algorithm. A high degree of parallelism is introduced in each pivot step, which can be carried out in O (log n) time using an m × n mesh of trees having an O(mn log m
BERTOSSI AA, BONUCCELLI, MAURIZIO ANGELO
openaire   +3 more sources

The Simplex Algorithm

1983
This and the next chapter are devoted to the presentation of the simplex algorithm for the numerical solution of linear optimization problems. This very important scheme was developed by Dantzig around 1950. We will see that the simplex algorithm consists of a sequence of exchange steps.
Klaus Glashoff, Sven-Åke Gustafson
openaire   +2 more sources

Home - About - Disclaimer - Privacy