„optimization methods“

Suchergebnisse

9.856 Treffer

• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
  Toint, Philippe L.
• On the 0/1 knapsack polytope
  Weismantel, Robert
• On the degree and separability of nonconvexity and applications to optimization problems
  Thach, Phan Thien ; Konno, Hiroshi
• A gaussian upper bound for gaussian multi-stage stochastic linear programs
  Schweitzer, Eithan ; Avriel, Mordecai
• On the complexity of the exchange algorithm for minimax optimization problems
  Drezner, Zvi
• Clarification of certain (α, β)-polarity results of Bachem and Grötschel
  Sim, Soon-Kiong
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
  Ye, Yinyu
• Sensitivity analysis framework for variational inequalities
  Kyparisis, Jerzy
• Fast deterministic approximation for the multicommodity flow problem
  Radzik, Tomasz
• A variable rate refining triangulation
  Broadie, Mark N. ; Eaves, B. Curtis
• Minimum-perimeter domain assignment
  Yackel, Jonathan ; Meyer, Robert R. ; Christou, Ioannis
• Greedy algorithm and symmetric matroids
  Bouchet, André
• Equilibrium programming using proximal-like algorithms
  Flåm, Sjur Didrik ; Antipin, Anatoly S.
• Nonlinear rescaling and proximal-like methods in convex optimization
  Polyak, Roman ; Teboulle, Marc
• The steiner tree packing problem in VLSI design
  Grötschel, M. ; Martin, A. ; Weismantel, R.
• A dual-active-set algorithm for positive semi-definite quadratic programming
  Boland, N. L.
• A branch-and-cut algorithm for the equicut problem
  Brunetta, Lorenzo ; Conforti, Michele ; Rinaldi, Giovanni
• Flows on hypergraphs
  Cambini, Riccardo ; Gallo, Giorgio ; Scutellà, Maria Grazia
• Two kinds of normality in vector optimization
  Borwein, J. M. ; Nieuwenhuis, J. W.
• Discrete optimization in public rail transport
  Bussieck, M. R. ; Winter, T. ; Zimmermann, U. T.