„Program Analysis“

Suchergebnisse

7.892 Treffer

• Presolving in linear programming
  Andersen, Erling D. ; Andersen, Knud D.
• A robust sequential quadratic programming method
  Burke, J. V. ; Han, S-P
• Some relationships between lagrangian and surrogate duality in integer programming
  Karwan, Mark H. ; Rardin, Ronald L.
• A simple constraint qualification in convex programming
  Zhou, X. ; Sharifi Mokhtarian, F. ; Zlobec, S.
• A simplex algorithm for piecewise-linear programming III: Computational analysis and applications
  Fourer, Robert
• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
  Ho, James K. ; Loute, Etienne
• A cutting plane method from analytic centers for stochastic programming
  Bahn, O. ; Merle, O. du ; Goffin, J. -L ; Vial, J. -P
• Theory and algorithms for linear multiple objective programs with zero–one variables
  Bitran, Gabriel R.
• Finding an interior point in the optimal face of linear programs
  Mehrotra, Sanjay ; Ye, Yinyu
• Strong formulations for mixed integer programming: A survey
  Wolsey, Laurence
• Finite dimensional approximation in infinite dimensional mathematical programming
  Schochetman, Irwin E. ; Smith, Robert L.
• Characterization of perturbed mathematical programs and interval analysis
  Dinkel, John J. ; Tretter, Marietta J.
• An interior point algorithm for semi-infinite linear programming
  Ferris, M. C. ; Philpott, A. B.
• A cutting plane algorithm for convex programming that uses analytic centers
  Atkinson, David S. ; Vaidya, Pravin M.
• On the number of iterations of Karmarkar's algorithm for linear programming
  Powell, M. J. D.
• Sequential convexification in reverse convex and disjunctive programming
  Balas, Egon ; Tama, Joseph M. ; Tind, Jørgen
• A polynomial method of approximate centers for linear programming
  Roos, C. ; Vial, J. -Ph
• Lagrangean decomposition for integer nonlinear programming with linear constraints
  Michelon, Philippe ; Maculan, Nelson
• An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
  Pardalos, P. M. ; Kovoor, N.
• Finding all maximal efficient faces in multiobjective linear programming
  Armand, Paul