KORBX® (a registered trademark of AT&T) is AT&T’s new system for solving large-scale linear programs. The system consists of both hardware, which uses parallel processing technology configured with 256 MB of memory, and software which exploits the design and resources of this modern hardware. The KORBX linear programming software system contains four algorithms which are variations of the interior point method of Narendra Karmarkar. The primal, dual, primal-dual, and power series algorithms were empirically evaluated on a set of linear programming application models being used by the staff of the Military Airlift Command at Scott Air Force Base. For calibration purposes, a set of smaller test problems were also run using MPSX and XMP; and some pure network problems were solved using NETFLO, MPSX, and XMP.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 49 articles )

Showing results 1 to 20 of 49.
Sorted by year (citations)

1 2 3 next

  1. Huangfu, Qi; Hall, J.A.Julian: Novel update techniques for the revised simplex method (2015)
  2. Bocanegra, Silvana; Castro, Jordi; Oliveira, Aurelio R.L.: Improving an interior-point approach for large block-angular problems by hybrid preconditioners (2013)
  3. Castro, Jordi; Cuesta, Jordi: Quadratic regularizations in an interior-point method for primal block-angular problems (2011)
  4. Hall, J.A.J.: Towards a practical parallelisation of the simplex method (2010)
  5. Gonçalves, João P.M.; Storer, Robert H.; Gondzio, Jacek: A family of linear programming algorithms based on an algorithm by von Neumann (2009)
  6. Al-Jeiroudi, Ghussoun; Gondzio, Jacek; Hall, Julian: Preconditioning indefinite systems in interior point methods for large scale linear optimisation (2008)
  7. Herrero, José R.; Navarro, Juan J.: Hypermatrix oriented supernode amalgamation (2008)
  8. Castro, Jordi: An interior-point approach for primal block-angular problems (2007)
  9. Herrero, José R.; Navarro, Juan J.: Sparse hypermatrix Cholesky: customization for high performance (2007)
  10. Herrero, José R.; Navarro, Juan J.: Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (2007)
  11. Hall, J.A.J.; McKinnon, K.I.M.: Hyper-sparsity in the revised simplex method and how to exploit it (2005)
  12. Oliveira, A.R.L.; Sorensen, D.C.: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (2005)
  13. Pan, Ping-Qi: A revised dual projective pivot algorithm for linear programming (2005)
  14. Davis, Timothy A.; Gilbert, John R.; Larimore, Stefan I.; Ng, Esmond G.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm (2004)
  15. Larsson, Torbjörn; Yuan, Di: An augmented Lagrangian algorithm for large scale multicommodity routing (2004)
  16. Castro, Jordi: Solving difficult multicommodity problems with a specialized interior-point algorithm (2003)
  17. Bixby, Robert E.: Solving real-world linear programs: A decade and more of progress (2002)
  18. Bixby, Robert E.; Fenelon, Mary; Gu, Zhonghao; Rothberg, Ed; Wunderling, Roland: MIP: Theory and practice -- closing the gap (2000)
  19. Castro, Jordi: A specialized interior-point algorithm for multicommodity network flows (2000)
  20. Mamer, John W.; Mcbride, Richard D.: A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem (2000)

1 2 3 next