„optimization methods“

Suchergebnisse

9.856 Treffer

• A decomposition property of polyhedra
  Werra, D. de
• Computational experience with advanced implementation of decomposition algorithms for linear programming
  Ho, J. K. ; Loute, E.
• Termination and equivalence results for conjugate gradient algorithms
  Buckley, A.
• An application of homotopy to solving linear programs
  Garcia, C. B. ; Gould, F. J.
• An O(n) algorithm for the multiple-choice knapsack linear program
  Dyer, M. E.
• On the average number of steps of the simplex method of linear programming
  Smale, Steve
• The sphere method and the robustness of the ellipsoid algorithm
  Halfin, S.
• Automatic identification of embedded network rows in large-scale optimization models
  Brown, Gerald G. ; Wright, William G.
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles
  Grötschel, Martin ; Nemhauser, George L.
• Error bounds for the aggregated convex programming problem
  Huberman, Gur
• Proving total dual integrality with cross-free families—A general framework
  Schrijver, A.
• On characterizingL 1-supports, natural and Chebyshev approximates
  Grotzinger, Stephen J.
• Fractional covers for forests and matchings
  Padberg, Manfred W. ; Wolsey, Laurence A.
• The continuous collapsing Knapsack problem
  Posner, Marc E.
• Complexity of some parametric integer and network programming problems
  Carstensen, Patricia J.
• Solving staircase linear programs by the simplex method, 2: Pricing
  Fourer, Robert
• The primal douglas-rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
  Fukushima, Masao
• Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ −2 KNM) timetime
  Grigoriadis, Michael D. ; Khachiyan, Leonid G.
• Binary integer programs with two variables per inequality
  Sewell, E. C.
• A new algorithm for minimizing convex functions over convex sets
  Vaidya, Pravin M.