PPRN

The PPRN package was developed in the Statistics and Operations Research Dept. at Universitat Politecnica de Catalunya, Barcelona (Spain), by Jordi Castro and Narcís Nabona. The package is appropriate for solving single/multicommodity network flow problems with linear/nonlinear objective function and with/without linear side constraints. Thus it can be viewed as a general package for solving a high variety of network flow problems (though it was originally designed for solving nonlinear multicommodity problems with side constraints). The code has been tested comparing its performance against other codes. When solving pure linear network flow problems, it has proved to be faster than alternative codes like NETFLO (J. Kennington) or RELAX-IV (D. Bertsekas) in all cases tried of a battery of dimacs problems. When solving linear multicommodity problems its performance was in general better, though not in all the cases tested, than that of MCNF85 (J. Kennington). For nonlinear problems it has only been compared with general purpose packages like MINOS (Murtagh and Saunders) and PPRN always outperformed it.


References in zbMATH (referenced in 28 articles )

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

1 2 next

  1. Fonoberova, Maria: Optimal flows in dynamic networks and algorithms for their finding (2012)
  2. Cruz, Jose M.; Liu, Zugang: Modeling and analysis of the multiperiod effects of social relationship on supply chain networks (2011)
  3. Frangioni, Antonio; Gentile, Claudio; Grande, Enrico; Pacifici, Andrea: Projected perspective reformulations with applications in design problems (2011)
  4. Machado, Catia M.S.; Mayerle, Sergio F.; Trevisan, Vilmar: A linear model for compound multicommodity network flow problems (2010)
  5. Root, Sarah; Cohn, Amy: A novel modeling approach for express package carrier planning (2008)
  6. Alvelos, Filipe; Valério de Carvalho, J.M.: An extended model and a column generation algorithm for the planar multicommodity flow problem (2007)
  7. Di Gaspero, Luca; Gärtner, Johannes; Kortsarz, Guy; Musliu, Nysret; Schaerf, Andrea; Slany, Wolfgang: The minimum shift design problem (2007)
  8. Ouorou, Adam: A proximal subgradient projection algorithm for linearly constrained strictly convex problems (2007)
  9. Ouorou, Adam: Implementing a proximal algorithm for some nonlinear multicommodity flow problems (2007)
  10. Frangioni, Antonio; Manca, Antonio: A computational study of cost reoptimization for min-cost flow problems (2006)
  11. Fonoberova, Maria A.; Lozovanu, Dmitrii D.: The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving (2005)
  12. Fonoberova, M.; Lozovanu, D.: Optimal multicommodity flows in dynamic networks and algorithms for their finding (2005)
  13. Mijangos, E.: An efficient method for nonlinearly constrained networks (2005)
  14. Castro, Jordi; González, José A.: A nonlinear optimization package for long-term hydrothermal coordination. (2004)
  15. Larsson, Torbjörn; Yuan, Di: An augmented Lagrangian algorithm for large scale multicommodity routing (2004)
  16. McBride, Richard D.; Mamer, John W.: Implementing an LU factorization for the embedded network simplex algorithm (2004)
  17. Castro, Jordi: Solving difficult multicommodity problems with a specialized interior-point algorithm (2003)
  18. Holmberg, Kaj; Yuan, Di: A multicommodity network-flow problem with side constraints on paths solved by column generation (2003)
  19. Castro, Jordi: Network flows heuristics for complementary cell suppression: An empirical evaluation and extensions (2002)
  20. Guerriero, F.; Tseng, P.: Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (2002)

1 2 next