Results: << | 101-125 | 126-150 | 151-175 | 176-200 | >>

Table of contents of journal: *Mathematical programming (Print)

Results: 126-150/767

Authors: Lovasz, L
Citation: L. Lovasz, Hit-and-run mixes fast, MATH PROGR, 86(3), 1999, pp. 443-461

Authors: Nemirovski, A Roos, C Terlaky, T
Citation: A. Nemirovski et al., On maximization of quadratic form over intersection of ellipsoids with common center, MATH PROGR, 86(3), 1999, pp. 463-473

Authors: Ferris, MC Kanzow, C Munson, TS
Citation: Mc. Ferris et al., Feasible descent algorithms for mixed complementarity problems, MATH PROGR, 86(3), 1999, pp. 475-497

Authors: Boyd, S Carr, R
Citation: S. Boyd et R. Carr, A new bound for the ratio between the 2-matching problem and its linear programming relaxation, MATH PROGR, 86(3), 1999, pp. 499-514

Authors: Stubbs, RA Mehrotra, S
Citation: Ra. Stubbs et S. Mehrotra, A branch-and-cut method for 0-1 mixed convex programming, MATH PROGR, 86(3), 1999, pp. 515-532

Authors: Peng, JM Lin, ZH
Citation: Jm. Peng et Zh. Lin, A non-interior continuation method for generalized linear complementarity problems, MATH PROGR, 86(3), 1999, pp. 533-563

Authors: Vanderbeck, F
Citation: F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, MATH PROGR, 86(3), 1999, pp. 565-594

Authors: Ceria, S Soares, J
Citation: S. Ceria et J. Soares, Convex programming for disjunctive convex optimization, MATH PROGR, 86(3), 1999, pp. 595-614

Authors: Heinkenschloss, M Ulbrich, M Ulbrich, S
Citation: M. Heinkenschloss et al., Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption, MATH PROGR, 86(3), 1999, pp. 615-635

Authors: Mohan, SR Neogy, SK Parthasarathy, T Sinha, S
Citation: Sr. Mohan et al., Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure, MATH PROGR, 86(3), 1999, pp. 637-648

Authors: Bofill, WG
Citation: Wg. Bofill, Properties of an interior embedding for solving nonlinear optimization problems, MATH PROGR, 86(3), 1999, pp. 649-659

Authors: Freund, RM Vera, JR
Citation: Rm. Freund et Jr. Vera, Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system, MATH PROGR, 86(2), 1999, pp. 225-260

Authors: Berkelaar, AB Jansen, B Roos, K Terlaky, T
Citation: Ab. Berkelaar et al., Basis- and partition identification for quadratic programming and linear complementarity problems, MATH PROGR, 86(2), 1999, pp. 261-282

Authors: Larsson, T Patriksson, M Stromberg, AB
Citation: T. Larsson et al., Ergodic, primal convergence in dual subgradient schemes for convex programming, MATH PROGR, 86(2), 1999, pp. 283-312

Authors: Tutuncu, RH
Citation: Rh. Tutuncu, An infeasible-interior-point potential-reduction algorithm for linear programming, MATH PROGR, 86(2), 1999, pp. 313-334

Authors: Cordier, C Marchand, H Laundy, R Wolsey, LA
Citation: C. Cordier et al., bc-opt: a branch-and-cut code for mixed integer programs, MATH PROGR, 86(2), 1999, pp. 335-353

Authors: Granot, D Hamers, H Tijs, S
Citation: D. Granot et al., On some balanced, totally balanced and submodular delivery games, MATH PROGR, 86(2), 1999, pp. 355-366

Authors: Peng, JM Fukushima, M
Citation: Jm. Peng et M. Fukushima, A hybrid Newton method for solving the variational inequality problem via the D-gap function, MATH PROGR, 86(2), 1999, pp. 367-386

Authors: Ruckmann, JJ
Citation: Jj. Ruckmann, On existence and uniqueness of stationary points in semi-infinite optimization, MATH PROGR, 86(2), 1999, pp. 387-415

Authors: Deng, XT Papadimitriou, C
Citation: Xt. Deng et C. Papadimitriou, Decision-making by hierarchies of discordant agents, MATH PROGR, 86(2), 1999, pp. 417-431

Authors: Daniilidis, A Hadjisavvas, N
Citation: A. Daniilidis et N. Hadjisavvas, Coercivity conditions and variational inequalities, MATH PROGR, 86(2), 1999, pp. 433-438

Authors: Levy, AB
Citation: Ab. Levy, Errata in implicit multifunction theorems for the sensitivity analysis of variational conditions, MATH PROGR, 86(2), 1999, pp. 439-441

Authors: Wallacher, C Zimmerman, UT
Citation: C. Wallacher et Ut. Zimmerman, A polynomial cycle canceling algorithm for submodular flows, MATH PROGR, 86(1), 1999, pp. 1-15

Authors: Gunluk, O
Citation: O. Gunluk, A branch-and-cut algorithm for capacitated network design problems, MATH PROGR, 86(1), 1999, pp. 17-39

Authors: Robinson, SM
Citation: Sm. Robinson, Linear convergence of epsilon-subgradient descent methods for a class of convex functions, MATH PROGR, 86(1), 1999, pp. 41-50
Risultati: << | 101-125 | 126-150 | 151-175 | 176-200 | >>