IPM is a specialized interior-point code for multicommodity network flows developed by Jordi Castro. The algorithm is specially appropriate for large and difficult multicommodity problems (such as the PDS -Patient Distribution System- ones). There are two versions of the code, both of them free of charge for academic/research purposes. The first one makes use of the Sparspak package by George and Liu. To obtain this version just get this file, gunzip and untar it on the directory where IPM will be installed, and read the README file that will be obtained. The second version uses the more efficient Sparse Cholesky package developed by E. Ng and B. Peyton. To obtain this more powerful version of IPM, get this file, gunzip and untar it on the directory where IPM will be installed, and read the README file that will appear. Note that to use this second version of IPM you need the permission of the authors of the Sparse Cholesky package (you can send a message to E. Ng). (Source: http://plato.asu.edu)

References in zbMATH (referenced in 32 articles , 3 standard articles )

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

1 2 next

  1. Gondzio, Jacek; González-Brevis, Pablo; Munari, Pedro: Large-scale optimization with the primal-dual column generation method (2016)
  2. Dell’Acqua, Pietro; Frangioni, Antonio; Serra-Capizzano, Stefano: Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems (2015)
  3. Bocanegra, Silvana; Castro, Jordi; Oliveira, Aurelio R.L.: Improving an interior-point approach for large block-angular problems by hybrid preconditioners (2013)
  4. Castro, Jordi; Cuesta, Jordi: Solving $ L_1$-CTA in 3D tables by an interior-point method for primal block-angular problems (2013)
  5. Gondzio, Jacek: Interior point methods 25 years later (2012)
  6. Petra, Cosmin G.; Anitescu, Mihai: A preconditioning technique for Schur complement systems arising in stochastic optimization (2012)
  7. Castro, Jordi; Cuesta, Jordi: Quadratic regularizations in an interior-point method for primal block-angular problems (2011)
  8. Castro, Jordi; Cuesta, Jordi: Existence, uniqueness, and convergence of the regularized primal-dual central path (2010)
  9. Machado, Catia M.S.; Mayerle, Sergio F.; Trevisan, Vilmar: A linear model for compound multicommodity network flow problems (2010)
  10. Alabi, Adebayo; Castro, Jordi: Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning (2009)
  11. Bompadre, Agustín; Orlin, James B.: A simple method for improving the primal simplex method for the multicommodity flow problem (2008)
  12. Salles, Ronaldo M.; Barria, Javier A.: Lexicographic maximin optimisation for fair bandwidth allocation in computer networks (2008)
  13. Alvelos, Filipe; Valério de Carvalho, J.M.: An extended model and a column generation algorithm for the planar multicommodity flow problem (2007)
  14. Castro, Jordi: An interior-point approach for primal block-angular problems (2007)
  15. Frangioni, A.; Gentile, C.: Prim-based support-graph preconditioners for min-cost flow problems (2007)
  16. Herrero, José R.; Navarro, Juan J.: Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (2007)
  17. Babonneau, F.; Du Merle, O.; Vial, J.-P.: Solving large-scale linear multicommodity flow problems with an active set strategy and proximal-ACCPM (2006)
  18. Castro, Jordi: Minimum-distance controlled perturbation methods for large-scale tabular data protection (2006)
  19. Fonoberova, Maria A.; Lozovanu, Dmitrii D.: The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving (2005)
  20. Fonoberova, M.; Lozovanu, D.: Optimal multicommodity flows in dynamic networks and algorithms for their finding (2005)

1 2 next