Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Mathematical Programming

Search In Journal Title:

Abbravation: Mathematical Programming

Search In Journal Abbravation:

Publisher

Springer Berlin Heidelberg

Search In Publisher:

DOI

10.1006/nbdi.2002.0497

Search In DOI:

ISSN

1436-4646

Search In ISSN:
Search In Title Of Papers:

The factorization approach to largescale linear p

Authors: G W Graves R D McBride
Publish Date: 1976/12/01
Volume: 10, Issue: 1, Pages: 91-110
PDF Link

Abstract

A unifying concept for largescale linear programming is developed This approach calledfactorization allows one to isolate the effect of different types of constraints and variables in the algebraic representation of the tableau Two different factorizations based on a double representation of the tableau are developed These factorizations are applied to obtain the essential structure of efficient algorithms for generalized upper bounding coupled blockdiagonal problems set partitioning LPs minimum cost network flows and other classes of problemsThis research was supported in part by the National Science Foundation and the Office of Naval Research An earlier version of this paper was presented at the Eighth International Symposium on Mathematical Programming Stanford University August 1973

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Submodular maximization meets streaming: matchings, matroids, and more
  2. Some computationally relevant group theoretic structures of fixed charge problems
  3. Applications of convex analysis within mathematics
  4. Large-scale semidefinite programs in electronic structure calculation
  5. A distributionally robust perspective on uncertainty quantification and chance constrained programming
  6. Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
  7. A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
  8. Breakpoint searching algorithms for the continuous quadratic knapsack problem
  9. Sandwich games
  10. Approximations of Nash equilibria
  11. Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
  12. A robust and efficient method for solving point distance problems by homotopy
  13. A nonmonotone GRASP
  14. Extreme point inequalities and geometry of the rank sparsity ball
  15. Primal-dual interior-point methods for PDE-constrained optimization
  16. A new branch-and-cut algorithm for the capacitated vehicle routing problem
  17. Single item lot-sizing with non-decreasing capacities
  18. Structural and algorithmic properties for parametric minimum cuts
  19. Simple integer recourse models: convexity and convex approximations
  20. A model of the coNP-complete non-Hamilton tour decision problem for directed graphs
  21. Iteration complexity analysis of block coordinate descent methods
  22. Error Bounds of Regularized Gap Functions for Nonsmooth Variational Inequality Problems
  23. Accelerating the cubic regularization of Newton’s method on convex problems
  24. Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
  25. On the number of solutions to the linear comple-mentarity problem
  26. Time-consistent approximations of risk-averse multistage stochastic optimization problems
  27. PEBBL: an object-oriented framework for scalable parallel branch and bound
  28. PEBBL: an object-oriented framework for scalable parallel branch and bound
  29. The capacitated max k -cut problem
  30. Critical extreme points of the 2-edge connected spanning subgraph polytope
  31. Nash equilibria in the two-player kidney exchange game
  32. On some properties and an application of the logarithmic barrier method
  33. Complementarity systems in optimization
  34. On the exact separation of mixed integer knapsack cuts
  35. Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
Search Result: