PAGP

PAGP, a partitioning algorithm for (linear) goal programming problems (Source: http://dl.acm.org/)

This software is also peer reviewed by journal TOMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 9 articles )

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

  1. Zanette, Arrigo; Fischetti, Matteo; Balas, Egon: Lexicography and degeneracy: Can a pure cutting plane algorithm work? (2011)
  2. Balas, Egon; Fischetti, Matteo; Zanette, Arrigo: On the enumerative nature of Gomory’s dual cutting plane method (2010)
  3. Kasana, H. S.; Kumar, K. D.: Grouping algorithm for linear goal programming problems (2003)
  4. Saber, Hussein M.; Ravindran, A.: A partitioning gradient based (PGB) algorithm for solving nonlinear goal programming problems (1996)
  5. Sutardi; Bector, C. R.; Goulter, Ian: Multiobjective water resources investment planning under budgetary uncertainty and fuzzy environment (1995)
  6. Saber, Hussein M.; Ravindran, A.: Nonlinear goal programming theory and practice: A survey (1993)
  7. Lashine, Sherif; Foote, B.; Ravindran, A.: A nonlinear mixed integer goal programming model for the two-machine closed flow shop (1991)
  8. Grove, M. A.: A surrogate for linear programs with random requirements (1988)
  9. Arthur, Jeffrey L.; Ravindran, A.: PAGP, a partitioning algorithm for (linear) goal programming problems (1980)