Ein Simplex-algorithms für das partitionsbeschränke Zuordnungsproblem = Un algorithme simplexe appliqué au problème d'affectation avec contrainte de partition = A simplex algorithm for the partition constrained assigment problemLECLERC, M.Siemens Forschungs- und Entwicklungsberichte. 1988, Vol 17, Num 4, pp 199-203, issn 0370-9736Article

Computational method for evaluating and optimizing response surface curves based on mixture designsGONZALEZ-ARJONA, D; GONZALEZ, A. G.Analytica chimica acta. 1994, Vol 293, Num 1-2, pp 205-210, issn 0003-2670Article

Is the mass of Mercury 1/6000000?BRANHAM, R. L.Celestial mechanics & dynamical astronomy. 1991, Vol 50, Num 2, pp 189-191, issn 0923-2958Article

Optimization via the simplex methodTAO, B. Y.Chemical engineering (New York, NY). 1988, Vol 95, Num 2, pp 85-89, issn 0009-2460Article

Parallel simulated annealing using simplex methodLUO, Ya-Zhong; TANG, Guo-Jin.AIAA journal. 2006, Vol 44, Num 12, pp 3143-3146, issn 0001-1452, 4 p.Conference Paper

Méthodes directes d'optimisation : Méthodes dérivées de la méthode Simplex = Optimization direct methods : methods derived from the Simplex methodPORTE, Catherine.Techniques de l'ingénieur. Analyse et caractérisation. 2002, Vol P1, Num P229, pp P229.1-P229.14, issn 1762-8717Article

Optimisation d'une expérimentation par le Simplex = The experimentation can be optimised by the Simplex methodORTIGOSA, C.Lyon pharmaceutique. 1989, Vol 40, Num 5, pp 315-320, issn 0024-7804Article

Hoffman's circle untangledLEE, J.SIAM review (Print). 1997, Vol 39, Num 1, pp 98-105, issn 0036-1445Article

Initialization of the simplex algorithm : An artificial-free approachARSHAM, H.SIAM review (Print). 1997, Vol 39, Num 4, pp 736-744, issn 0036-1445Article

An experimental approach to Karmarkar's projective method for linear programmingTOMLIN, J. A.Mathematical programming study. 1987, Vol 31, pp 175-191, issn 0303-3929Conference Paper

Optimization using the modified simplex methodMORGAN, E; BURTON, K. W; NICKLESS, G et al.Chemometrics and intelligent laboratory systems. 1990, Vol 7, Num 3, pp 209-222Article

Visualizing and Constructing Cycles in the Simplex MethodAVIS, David; KALUZNY, Bohdan; TITLEY-PELOQUIN, David et al.Operations research. 2008, Vol 56, Num 2, pp 512-518, issn 0030-364X, 7 p.Article

A relaxation column signature method for assignment problemsPAPARRIZOS, K.European journal of operational research. 1991, Vol 50, Num 2, pp 211-219, issn 0377-2217Article

On practical stopping rules for the simplex methodOGRYCZAK, W.Mathematical programming study. 1987, Vol 31, pp 167-174, issn 0303-3929Conference Paper

Homogeneous simplex splinesNEAMTU, M.Journal of computational and applied mathematics. 1996, Vol 73, Num 1-2, pp 173-189, issn 0377-0427Article

Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascentBOYD, E. A.Mathematical programming. 1995, Vol 68, Num 3, pp 155-168, issn 0025-5610Article

Efficient nested pricing in the simplex algorithmPAN, Ping-Qi.Operations research letters. 2008, Vol 36, Num 3, pp 309-313, issn 0167-6377, 5 p.Article

The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cyclingHALL, J. A. J; MCKINNON, K. I. M.Mathematical programming. 2004, Vol 100, Num 1, pp 133-150, issn 0025-5610, 18 p.Article

On the equivalence of the simplex methods and a multiplier-alike method for linear programmingCHANG, T. S; ADACHI, J; WANG, X et al.Journal of optimization theory and applications. 2002, Vol 113, Num 3, pp 487-512, issn 0022-3239Article

On senary simplex codesGUPTA, Manish K; GLYNN, David G; GULLIVER, T. Aaron et al.Lecture notes in computer science. 2001, pp 112-121, issn 0302-9743, isbn 3-540-42911-5Conference Paper

Identification tridimensionnelle des paramètres complexes des disques céramiques piézoélectriques = Three dimensional optimisation technique for complex parameter identification of piezoceramic disksNACHEF, S; BRISSAUD, M; NOTERMAN, D et al.Acustica. 1992, Vol 77, Num 5, pp 209-220, issn 0001-7884Article

A study of expansion / contraction coefficients and starting point criteria in a variable size simplex optimizationWALTERS, F. H; KOON, W. K.Analytical letters. 1991, Vol 24, Num 3, pp 519-528, issn 0003-2719, 10 p.Article

On the finiteness of the criss-cross methodFUKUDA, K; MATSUI, T.European journal of operational research. 1991, Vol 52, Num 1, pp 119-124, issn 0377-2217Article

Optimizing the physicoceramic properties of silica products using simplex-grid planningKHONCHIK, I. V; KVASMAN, N. M; BULAKH, V. L et al.Refractories (New York). 1991, Vol 32, Num 9-10, pp 524-527, issn 0034-3102Article

Pythagorean theorems on rectangular tetrahedronEUNG GUN CHO.Applied mathematics letters. 1991, Vol 4, Num 6, pp 37-38, issn 0893-9659Article