kw.\*:("Méthode plan sécant")
Resultados 1 a 25 de 562
Selección :
The mixed cutting plane algorithm for all-integer programmingAUSTIN, L. M; RUPAREL, B. C.Computers & operations research. 1986, Vol 13, Num 4, pp 395-401, issn 0305-0548Article
Facet inequalities from simple disjunctions in cutting plane theorySEN, S; SHERALI, H. D.Mathematical programming. 1986, Vol 34, Num 1, pp 72-83, issn 0025-5610Article
On generating cutting planes from combinatorial disjunctionsSHERALI, H. D; SEN, S.Operations research. 1985, Vol 33, Num 4, pp 928-933, issn 0030-364XArticle
A surrogate cutting plane algorithm for all-integer programmingAUSTIN, L. M.Computers & operations research. 1985, Vol 12, Num 3, pp 241-250, issn 0305-0548Article
On the convergence of cutting plane algorithms for a class of nonconvex mathematical programsSEN, S; SHERALI, S. D.Mathematical programming. 1985, Vol 31, Num 1, pp 42-56, issn 0025-5610Article
A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problemsCOLE, F; GOCHET, W; SMEERS, Y et al.Journal of optimization theory and applications. 1985, Vol 47, Num 2, pp 159-180, issn 0022-3239Article
An advanced start algorithm for all-integer programmingHANNA, M. E; AUSTIN, L. M.Computers & operations research. 1985, Vol 12, Num 3, pp 301-309, issn 0305-0548Article
Analytic center cutting-plane method with deep cuts for semidefinite feasibility problemsCHUA, S. K; TOH, K. C; ZHAO, G. Y et al.Journal of optimization theory and applications. 2004, Vol 123, Num 2, pp 291-318, issn 0022-3239, 28 p.Article
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ballBOYD, E. A.Operations research letters. 1997, Vol 20, Num 2, pp 59-63, issn 0167-6377Article
Some facets for an assignment problem with side constraintsRONNY ABOUDI; NEMHAUSER, G. L.Operations research. 1991, Vol 39, Num 2, pp 244-250, issn 0030-364XArticle
Lower subdifferentiable functions and their minimization by cutting planesPLASTRIA, F.Journal of optimization theory and applications. 1985, Vol 46, Num 1, pp 37-53, issn 0022-3239Article
Mixing mixed-integer inequalitiesGÜNLÜK, Oktay; POCHET, Yves.Mathematical programming. 2001, Vol 90, Num 3, pp 429-457, issn 0025-5610Article
Finite master programs in regularized stochastic decompositionHIGLE, J. L; SUVRAJEET SEN.Mathematical programming. 1994, Vol 67, Num 2, pp 143-168, issn 0025-5610Article
Fractional programming by lower subdifferentiability techniquesBONCOMPTE, M; MARTINEZ-LEGAZ, J. E.Journal of optimization theory and applications. 1991, Vol 68, Num 1, pp 95-116, issn 0022-3239Article
Cutting plane and branch and bound for solving a class of scheduling problemsWOLFE, C. S.IIE transactions. 1984, Vol 16, Num 1, pp 50-58, issn 0740-817XArticle
Lower subdifferentiability of quadratic functionsMARTINEZ-LEGAZ, J. E; ROMANO-RODRIGUEZ, S.Mathematical programming. 1993, Vol 60, Num 1, pp 93-113, issn 0025-5610Article
A cutting plane algorithm for minimum perfect 2-matehingsGRÖTSCHEL, M; HOLLAND, O.Computing (Wien. Print). 1987, Vol 39, Num 4, pp 327-344, issn 0010-485XArticle
A finitely converging cutting plane techniqueORLIN, J. B.Operations research letters. 1985, Vol 4, Num 1, pp 1-3, issn 0167-6377Article
Scatter search for project scheduling with resource availability costSATO YAMASHITA, Denise; AMARAL ARMENTANO, Vinicius; LAGUNA, Manuel et al.European journal of operational research. 2006, Vol 169, Num 2, pp 623-637, issn 0377-2217, 15 p.Article
Using selective orthonormalization to update the analytic center after addition of multiple cutsMITCHELL, J. E; RAMASWAMY, S.Journal of optimization theory and applications. 2005, Vol 125, Num 2, pp 431-451, issn 0022-3239, 21 p.Article
An approach for multiple criteria simulation optimization with application to turning operationLEE, Y.-H; SHIN, H.-M; YANG, B.-H et al.Computers & industrial engineering. 1996, Vol 30, Num 3, pp 375-386, issn 0360-8352Article
Canonical DC programming problem : outer approximation methods revisitedHOANG TUY.Operations research letters. 1995, Vol 18, Num 2, pp 99-106, issn 0167-6377Article
Shallow, deep and very deep cuts in the analytic center cutting plane methodGOFFIN, J.-L; VIAL, J.-P.Mathematical programming. 1999, Vol 84, Num 1, pp 89-103, issn 0025-5610Article
Generalized fractional programming and cutting plane algorithmsBARROS, A. I; FRENK, J. B. G.Journal of optimization theory and applications. 1995, Vol 87, Num 1, pp 103-120, issn 0022-3239Article
Complexity estimates of some cutting plane methods based on the analytic barrierNESTEROV, YU.Mathematical programming. 1995, Vol 69, Num 1, pp 149-176, issn 0025-5610Article