Results 241 to 250 of about 91,721 (300)

Iodine-Based Coordination Compounds: A Strategy Toward Antibiotic Potentiation. [PDF]

open access: yesInt J Mol Sci
Shepilov D   +10 more
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

A network simplex method

Mathematical Programming, 1976
Simple combinatorial modifications are given which ensure finiteness in the primal simplex method for the transshipment problem and the upper-bounded primal simplex method for the minimum cost flow problem. The modifications involve keeping "strongly feasible" bases.
openaire   +4 more sources

Simplex Method

open access: yes
Ovaj rad predstavlja analizu simpleks metode, temeljnog algoritma u domeni linearng programiranja. U uvodnom dijelu rada, istražuje se povijesni razvoj simpleks metode, naglašavajući njen značaj i doprinos evoluciji ove matematičke discipline.
Jajac, Luka
core   +4 more sources

The generalized simplex method

Operations Research Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Domingos M. Cardoso   +1 more
openaire   +3 more sources

The Simplex Method

open access: yes
Ovaj diplomski rad obrađuje temu linearnog programiranja, sa posebnim naglaskom na simpleks metodi. Simpleks metoda je jedan od najvažnijih algoritama za pronalazak optimalnog rješenja linearnog problema.
Cvijanović, Lucija
core   +5 more sources

A regularized simplex method

Central European Journal of Operations Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Csaba I. Fábián   +2 more
openaire   +2 more sources

Parallelizing the Dual Simplex Method

INFORMS Journal on Computing, 2000
We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics ...
Robert E. Bixby, Alexander Martin 0001
openaire   +1 more source

A Simplex Method for Function Minimization

The Computer Journal, 1965
A method is described for the minimization of a function of n variables, which depends on the comparison of function values at the (n 41) vertices of a general simplex, followed by the replacement of the vertex with the highest value by another point. The simplex adapts itself to the local landscape, and contracts on to the final minimum. The method is
John A. Nelder, R. Mead
openaire   +1 more source

Home - About - Disclaimer - Privacy