Advertisement

Combinatorial optimization problems that can be formulated as nonconvex quadratic problems

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

Keywords

Linear Complementarity Problem Quadratic Assignment Problem Feasible Domain Bilinear Programming Concave Minimization 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BAZA82]
    Bazaraa, M.S. and Sherali, H.D. On the use of exact and heuristic cutting plane methods for the quadratic assignment problem. J. Oper. Res. Soc. 33 (1982), 991–1003.Google Scholar
  2. [COTT68]
    Cottle, R.W. and Dantzig, G.B. Complementarity pivot theory of mathematical programming. In: G.B. Dantzig and A.F. Veinott, Jr., eds. Mathematics of the Decision Sciences, Part 1 (Amer. Math. Society, Providence, RI, 1968), 115–136.Google Scholar
  3. [FALK73]
    Falk, J.E. A linear max-min problem. Math. Progr. 5 (1973), 169–188.CrossRefGoogle Scholar
  4. [FRIE74]
    Frieze, A.M. A bilinear programming formulation of the 3-dimensional assignment problem. Math. Progr. 7 (1974), 376–379.CrossRefGoogle Scholar
  5. [GIAN76]
    Giannessi, F. and Niccolucci, F. Connections between nonlinear and integer programming problems. In: Symposia Mathematica Vol. XIX, Inst. Nazionale Di Alta Math. Academic Press (1976), 161–176.Google Scholar
  6. [GULA81]
    Gulati, V.P., Gupta, S.K., and Mittal, A.K. Unconstrained quadratic bivalent programming problem. European J. of Oper. Res. 15 (1981), 121–125.CrossRefGoogle Scholar
  7. [IVAN76]
    Ivanilov, Y.I. and Mukhamediev, B.M. An algorithm for solving the linear max-min problem. Izv. Akad. Nauk SSSR, Tekhn. Kibernitika No. 6 (1976), 3–10.Google Scholar
  8. [KALA82]
    Kalantari, B. and Rosen J.B. Penalty for zero-one integer equivalent problems. Math. Progr. 24 (1982), 229–232.CrossRefGoogle Scholar
  9. [KONN76]
    Konno, H. Maximization of a convex quadratic function subject to linear constraints. Math. Progr. 11 (1976), 117–127.CrossRefGoogle Scholar
  10. [LAWL63]
    Lawler, E.L. The quadratic assignment problem. Manag. Sc. 9 (1963), 586–599.Google Scholar
  11. [MANG78]
    Mangasarian, O.L. Characterization of linear complementarity problems as linear programs. Math. Progr. Study 7 (1978), 74–88.Google Scholar
  12. [PARD86]
    Pardalos, P.M. Construction of test problems in quadratic bivalent programming. Submitted to Discrete Appl. Math.Google Scholar
  13. [RAGH69]
    Raghavachari, M. On connections between zero-one integer programming and concave programming under linear constraints. Oper. Res. 17 (1969), 680–684.Google Scholar
  14. [THIE80]
    Thieu, T.V. Relationship between bilinear programming and concave minimization under linear constraints. Acta Math. Vietnam 5 (1980), 106–113.Google Scholar

Copyright information

© Springer-Verlag 1987

Personalised recommendations