Enumerative methods in nonconvex programming

Part of the Lecture Notes in Computer Science book series (LNCS, volume 268)


Extreme Point Linear Complementarity Problem Current Good Solution Nonconvex Programming Cost Minimum Flow Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AL-K85]
    Al-Khayyal, F.A. An implicit enumeration algorithm for the general linear complementarity problem. Tech. Report, School of Indust. and Syst. Engin., The Georgia Inst. of Technology (1985).Google Scholar
  2. [BALI61]
    Balinski, M.L. An algorithm for finding all vertices of polyhedral sets. J. Soc. Indust. Appl. Math. 9 (1961), 72–89.CrossRefGoogle Scholar
  3. [BAZA81]
    Bazara, M.S. and Sherali, H.D. A versatile scheme for ranking the extreme points of an assignment polytope. Naval Research Log. Quart. Vol. 28 (1981), No. 4.Google Scholar
  4. [CABO70]
    Cabot, V.A. and Francis, R.L. Solving certain nonconvex quadratic minimization problems by ranking the extreme points. Operations Research, Vol. 18 (1970), 82–86.Google Scholar
  5. [CHVA83]
    Chvatal, V. Linear Programming. Freeman N.Y. (1983)Google Scholar
  6. [BURD74]
    Burdet., C.A. Generating all faces of a polyhedron. SIAM J. Appl. Math. 26 (1974), 72–89.CrossRefGoogle Scholar
  7. [DAHL75]
    Dahl, G. and Storoy, S. Decomposed enumeration of extreme points in the linear programming problem. BIT 15 (1975), 151–157.CrossRefGoogle Scholar
  8. [DYER83]
    Dyer, M.E. The complexity of vertex enumeration methods. Math. Oper. Res. 8 (1983), 381–402.Google Scholar
  9. [DYER77]
    Dyer, M.E. and Proll, L.G. An algorithm for determining all extreme points of a convex polytope. Math. Progr. 12 (1977), 81–96.CrossRefGoogle Scholar
  10. [FLOR71]
    Florian, M. and Robillard, P. An implicit enumeration algorithm for the concave cost network flow problem. Manag. Science, Vol 18 (1971), 184–193.Google Scholar
  11. [JUDI85]
    Judice, J.J. and Mitra, G. An enumerative method for the solution set of linear complementarity problems. Working Paper, Math. Dept., Brunel Univer. (1985).Google Scholar
  12. [LINI86]
    Linial, N. Hard enumeration problems in geometry and combinatorics. SIAM J. Alg. Discr. Meth. Vol. 7, No 2 (1986), 331–335.Google Scholar
  13. [LOZO82]
    Lozovanu, D.D. Properties of optimal solutions of a grid transport problem with concave cost function of the flow on the arcs. Engin. Cybernetics Vol. 20 (1982), 34–38.Google Scholar
  14. [MATH80]
    Matheiss, T.H. and Rubin, D.S. A survey and comparison of methods for finding all vertices of convex polyhedral sets. Math. Oper. Reser. 5 (1980), 167–185.Google Scholar
  15. [McKE78]
    McKeown, P.G. Extreme point ranking algorithms: A computational survey. In Computers and Math. Progr., W.W. White ed., National Bureau of Standards Special Publication 502 (1978), U.S. Government Printing Office, Washington DC, 216–222.Google Scholar
  16. [MANA68]
    Manas, M. An algorithm for a nonconvex programming problem. Econom. Math. Obzor, Acad. Nacl. Ceskoslov. (1968), 202–212.Google Scholar
  17. [MANA74]
    Manas, M. and Nedoma, J. Finding all vertices of a convex polyhedral set. Numer. Mathem. 9 (1974), 35–39.Google Scholar
  18. [MART75]
    Martos, B. Nonlinear Programming: theory and methods North-Holland Publishing Company, (1975).Google Scholar
  19. [MURT68]
    Murty, K.G. Solving the fixed charge problem by ranking the extreme points. Operations Research, Vol 18 (1968), 268–279.Google Scholar
  20. [MURT83]
    Murty, K.G. Linear Programming Wiley (1983).Google Scholar
  21. [PARD86]
    Pardalos, P.M. An algorithm for a class of nonlinear fractional problems using ranking of the vertices. BIT 26 (1986), 392–395.CrossRefGoogle Scholar
  22. [ROSS73]
    Rossler, M. A method to calculate an optimal production plan with a concave objective function. Unternehmnsforschung, 20 (1973), 373–382.Google Scholar
  23. [SCHM80]
    Schmidt, B.K. and Mattheiss, T.H. Computational results on an algorithm for finding all vertices of a polytope. Math. Progr. Vol. 18 (1980), 308–329.CrossRefGoogle Scholar
  24. [STOR83]
    Storoy, S. Ranking of vertices in the linear fractional programming problem. BIT 23 (1983), No. 3, 403–405.CrossRefGoogle Scholar
  25. [TAHA73]
    Taha, H.A. Concave minimum over a convex polyhedron. Naval Res. Logist. Quart. Vol. 20 (1973), 353–355.Google Scholar
  26. [VALI79]
    Valiant, L.J. The complexity of enumeration and reliability problems. SIAM J. Comput., Vol 8 (1979), 410–421.Google Scholar
  27. [ZANG68]
    Zangwill, W.I. Minimum concave cost flows in certain networks. Manag. Science. Vol 14 (1968), 429–450.Google Scholar

Copyright information

© Springer-Verlag 1987

Personalised recommendations